CESAR

swMATH8510MaRDI QIDQ20519FDOQ20519

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Structure-based deadlock checking of asynchronous circuits
• \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
• Dependences in strategy logic
• Syntax-directed model checking of sequential programs
• Title not available (Why is that?)
• Model checking of pushdown systems for projection temporal logic
• Two normal form theorems for CSP programs
• Sémantique asynchrone et comportements infinis en CPS
• Title not available (Why is that?)
• Correct Hardware Design and Verification Methods
• Title not available (Why is that?)
• A theory of formal synthesis via inductive learning
• Fifty years of Hoare's logic
• Title not available (Why is that?)
• Vacuity in practice: temporal antecedent failure
• Automated formal analysis and verification: an overview
• Temporal logic and fair discrete systems
• Complete abstractions and subclassical modal logics
• On the unusual effectiveness of logic in computer science
• Probabilistic temporal logics via the modal mu-calculus
• Partitioned PLTL model-checking for refined transition systems
• An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
• Title not available (Why is that?)
• On the order of test goals in specification-based testing
• A canonical form based decision procedure and model checking approach for propositional projection temporal logic
• A complete axiom system for propositional projection temporal logic with cylinder computation model
• Flow logic
• Flow logic
• Control machines: A new model of parallelism for compositional specifications and their effective compilation
• Model checking with strong fairness
• From Philosophical to Industrial Logics
• Local proofs for global safety properties
• Verifying untimed and timed aspects of the experimental batch plant
• Logical vs. behavioural specifications
• Introduction to model checking
• Title not available (Why is that?)
• Model checking for hybrid logic
• Genetic Programming and Model Checking: Synthesizing New Mutual Exclusion Algorithms
• A novel approach to verifying context free properties of programs
• Integrating predicate transition nets with first order temporal logic in the specification and verification of concurrent systems
• Automatically verifying temporal properties of pointer programs with cyclic proof
• Model checking of systems with many identical timed processes
• Polynomial interrupt timed automata: verification and expressiveness
• Properties of a predicate transformer of the VRS system
• CTL Model-Checking with Graded Quantifiers
• A sound and complete proof system for a unified temporal logic
• Model checking and synthesis for branching multi-weighted logics
• Title not available (Why is that?)
• Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
• Synthesizing adaptive test strategies from temporal logic specifications
• Next-preserving branching bisimulation
• Meanings of model checking
• rCOS: defining meanings of component-based software architectures
• Verifying a network invariant for all configurations of the Futurebus+ cache coherence protocol
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal normal form for linear temporal logic formulae
• Measuring and synthesizing systems in probabilistic environments
• Combining model checking and testing
• Transfer of model checking to industrial practice
• Calculational design of a regular model checker by abstract interpretation
• Counting CTL
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• Title not available (Why is that?)
• Smaller Abstractions for ∀CTL* without Next
• Combining Model Checking and Deduction
• Mechanical software verification: high level control aspects from a user's perspective
• Formal language properties of hybrid systems with strong resets
• Title not available (Why is that?)
• A complete proof system for propositional projection temporal logic
• Dependences in strategy logic
• Real-Time Systems
• Alternating automata: unifying truth and validity checking for temporal logics
• Automated analysis of mutual exclusion algorithms using CCS
• Automatic verification of timed concurrent constraint programs
• An efficient approach for abstraction-refinement in model checking
• Augmenting ATL with strategy contexts
• Towards a notion of unsatisfiable and unrealizable cores for LTL
• Interrupt timed automata: verification and expressiveness
• Formal modelling, analysis and verification of hybrid systems
• Reasoning about networks with many identical finite state processes
• SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
• Characterizing finite Kripke structures in propositional temporal logic
• Supervisory control and reactive synthesis: a comparative introduction
• Module checking
• Using partial orders for the efficient verification of deadlock freedom and safety properties
• Title not available (Why is that?)
• Title not available (Why is that?)
• An automata-theoretic approach to infinite-state systems
• Symbolic model checking with rich assertional languages
• Enhanced vacuity detection in linear temporal logic.
• Coverage metrics for temporal logic model checking
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• An automata-theoretic approach to branching-time model checking
• Is your model checker on time? On the complexity of model checking for timed modal logics
• Explaining counterexamples using causality
• Priority scheduling of distributed systems based on model checking
• Title not available (Why is that?)
• Before and after vacuity
• Combining symmetry reduction and under-approximation for symbolic model checking

This page was built for software: CESAR