Sökning: "Symbolic Model Checking"
Visar resultat 11 - 15 av 21 avhandlingar innehållade orden Symbolic Model Checking.
11. Creating Correct Network Protocols
Sammanfattning : Network protocol construction is a complex and error prone task. The challenges originate both from the inherent complexity of developing correct program code and from the distributed nature of networked systems. Protocol errors can have devastating consequences. LÄS MER
12. Modelling and Verification of Real-Time Systems Using Timed Automata : Theory and Practice
Sammanfattning : During the last decade, model-checking techniques for the verification of timed system have been developed baaed on the theory of timed automata. The practical limitation in applying these techniques to industrial-size systems is the huge amount of time and memory needed to explore and store the state-space of the system model. LÄS MER
13. Learning Component Behavior from Tests : Theory and Algorithms for Automata with Data
Sammanfattning : Formal models are often used to describe the behavior of a computer program or component. Behavioral models have many different usages, e.g., in model-based techniques for software development and verification,such as model checking and model based testing. LÄS MER
14. Applications of SAT solving
Sammanfattning : In the area of formal verification it is well known that there can be no single logic that suits all needs. This insight motivates the diversity of this dissertation: it contains contributions to SAT solving, First Order theorem proving and Model Finding, and Symbolic Model Checking. LÄS MER
15. The Fusion Calculus : Expressiveness and Symmetry in Mobile Processes
Sammanfattning : The fusion calculus is presented as a significant step towards a canonical calculus of concurrency. It simplifies and extends the π-calculus of Milner, Parrow and Walker.The fusion calculus contains the polyadic π-calculus as a proper subcalculus and thus inherits all its expressive power. LÄS MER