Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alternating automata, the weak monadic theory of the tree, and its complexity
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Current trends in concurrency. Overviews and tutorials
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Model checking of CTL formulae under liveness assumptions
14th International Colloquium on Automata, languages and programming
Modalities for model checking: branching time logic strikes back
Science of Computer Programming
Alternating automata on infinite trees
Theoretical Computer Science
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modular verification of Petri Nets: the temporal logic approach
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Verifying the correctness of AADL modules using model checking
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning in a restricted temporal logic
Information and Computation
Reasoning about infinite computations
Information and Computation
Assumption/guarantee specifications in linear-time temporal logic
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
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 menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
On the Complexity of Branching Modular Model Checking (Extended Abstract)
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
MCTL - An Extension of CTL for Modular Verification of Concurrent Systems
Temporal Logic in Specification
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Generation of Reduced Models for Checking Fragments of CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Formula-Dependent Equivalence for Compositional CTL Model Checking
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
On the complexity of modular model checking
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Verification of Fair Transition Systems
Verification of Fair Transition Systems
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model Checking for Combined Logics with an Application to Mobile Systems
Automated Software Engineering
Applicability of fair simulation
Information and Computation
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Compositional verification of sequential programs with procedures
Information and Computation
Practical Efficient Modular Linear-Time Model-Checking
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Program Models for Compositional Verification
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Composing Modal Properties of Programs with Procedures
Electronic Notes in Theoretical Computer Science (ENTCS)
Applicability of fair simulation
Information and Computation
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model-based verification of adaptive embedded systems under environment constraints
ACM SIGBED Review - Special Issue on the 2nd International Workshop on Adaptive and Reconfigurable Embedded Systems (APRES'09)
Assume-guarantee reasoning with local specifications
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Abstraction for model checking modular interpreted systems over ATL
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Modelling, simulating and verifying turing-powerful strand displacement systems
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
State space representation for verification of open systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Abstraction for model checking modular interpreted systems over ATL
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
| Hi-index | 0.00 |
In modular verification the specification of a module consists of two part. One part describes the guaranteed behavior of the module. The other part describes the assumed behavior of the system in which the module is interacting. This is called the assume-guarantee paradigm. In this paper we consider assume-guarantee specifications in which the guarantee is specified by branching temporal formulas. We distinguish between two approaches. In the first approach, the assumption is specified by branching temporal formulas too. In the second approach, the assumption is specified by linear temporal logic. We consider guarantees in ∀ CTL, and ∀ CTL*. We develop two fundamental techniques: building maximal models for ∀ CTL and ∀ CTL* formulas and using alternating automata to obtain space-efficient algorithms for fair model checking. Using these techniques we classify the complexity of satisfiability, validity, implication, and modular verification for ∀ CTL and ∀ CTL*. We show that modular verification is PSPACE-complete for ∀ CTL and is EXSPACE-complete for ∀ CTL*. We prove that when the assumption is linear, these bounds hold also for guarantees in CTL and CTL*. On the other hand, the problem remains EXSPACE-hard even when we restrict the assumptions to LTL and take the guarantees as a fixed ∀ CTL formula.