Communicating sequential processes
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Synthesis of Communicating Processes from Temporal Logic Specifications
Logic of Programs, Workshop
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
The complexity of propositional linear temporal logics
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Verifying network protocols using temporal logic
Verifying network protocols using temporal logic
Rules for synthesizing correct communication protocols
ACM SIGCOMM Computer Communication Review
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Reasoning about networks with many identical finite-state processes
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Automatic Verification of Sequential Circuits Using Temporal Logic
IEEE Transactions on Computers
An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Adding liveness properties to coupled finite-state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formalization of Protocol Engineering Concepts
IEEE Transactions on Computers - Special issue on protocol engineering
A toolbox for the verification of LOTOS programs
ICSE '92 Proceedings of the 14th international conference on Software engineering
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Enhancing compositional reachability analysis with context constraints
SIGSOFT '93 Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of probabilistic verification
Journal of the ACM (JACM)
Context constraints for compositional reachability analysis
ACM Transactions on Software Engineering and Methodology (TOSEM)
Formal specification and verification of hardware: a comparative case study
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the analysis of cooperation and antagonism in networks of communicating processes
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
petri—a UNIX tool for the analysis of Petri nets
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Automatic Generation of Invariants
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Proceedings of the 37th Annual Design Automation Conference
On-the-Fly Model Checking Under Fairness that Exploits Symmetry
Formal Methods in System Design
Proving the Correctness of the Standardized Algorithm for ABR Conformance
Formal Methods in System Design
An infinite hierarchy of temporal logics over branching time
Information and Computation
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Markov decision processes and deterministic Büchi automata
Fundamenta Informaticae
PROSPEC: An Interactive Programming Environment for Designing and Verifying Communication Protocols
IEEE Transactions on Software Engineering
L.0: A Truly Concurrent Executable Temporal Logic Language for Protocols
IEEE Transactions on Software Engineering
On probabilistic timed automata
Theoretical Computer Science
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Verification of Automotive Control Units
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Automating Modular Verification
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Abstract BDDs: A Technque for Using Abstraction in Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
State Space Reduction Based on Live Variables Analysis
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Progress on the State Explosion Problem in Model Checking
Informatics - 10 Years Back. 10 Years Ahead.
Validation of Control System Specifications with Abstract Plant Models
SAFECOMP '00 Proceedings of the 19th International Conference on Computer Safety, Reliability and Security
Correctness Proof of the Standardized Algorithm for ABR Conformance
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Distributed Symbolic Model Checking for µ-Calculus
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Specific-to-general learning for temporal events
Eighteenth national conference on Artificial intelligence
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Symbolic Verification and Analysis of Discrete Timed Systems
Formal Methods in System Design
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
Distributed Symbolic Model Checking for μ-Calculus
Formal Methods in System Design
Run-time analysis of time-critical systems
Journal of Systems Architecture: the EUROMICRO Journal
Exploiting predicate structure for efficient reachability detection
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Model checking for the concurrent constraint paradigm: Thesis
AI Communications
Extending a Component Specification Language with Time
Electronic Notes in Theoretical Computer Science (ENTCS)
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Arity hierarchy for temporal logics
Theoretical Computer Science
Extending orchids for intrusion detection in 802.11 wireless networks
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Model Checking: Back and Forth between Hardware and Software
Verified Software: Theories, Tools, Experiments
LTLC: Linear Temporal Logic for Control
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
25 Years of Model Checking
25 Years of Model Checking
QMC: A Model Checker for Quantum Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Issues in using model checkers for test case generation
Journal of Systems and Software
Weakest Invariant Generation for Automated Addition of Fault-Tolerance
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of UML activities using dynamic meta modeling
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Faster SPDL model checking through property-driven state space generation
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Pillars of computer science
Science of Computer Programming
Science of Computer Programming
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Improved algorithm complexities for linear temporal logic model checking of pushdown systems
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Combining static analysis and model checking for systems employing commutative functions
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Model checking quantified computation tree logic
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Employing symmetry reductions in model checking
Computer Languages, Systems and Structures
Markov Decision Processes and Deterministic Büchi Automata
Fundamenta Informaticae
Performance evaluation of sensor networks by statistical modeling and euclidean model checking
ACM Transactions on Sensor Networks (TOSN)
Formal methods for ranking counterexamples through assumption mining
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
A rewriting logic approach to the formal specification and verification of web applications
Science of Computer Programming
| Hi-index | 0.00 |
We give an efficient procedure for verifying that a finite state concurrent system meets a specification expressed in a (propositional) branching-time temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global transition graph for the concurrent system. We also show how the logic and our algorithm can be modified to handle fairness. We argue that this technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite state concurrent systems.