Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
Formal Methods in System Design
Architecting families of software systems with process algebras
ACM Transactions on Software Engineering and Methodology (TOSEM)
Analysis of security protocols as open systems
Theoretical Computer Science
On the Existence of Network Invariants for Verifying Parameterized Systems
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Automatic Verification of Cryptographic Protocols through Compositional Analysis Techniques
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Testing Hennessy-Milner Logic with Recursion
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Compositional Verification of Synchronous Networks
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Efficient Model Checking Via Büchi Tableau Automata
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The power of reachability testing for timed automata
Theoretical Computer Science
Compositional analysis for verification of parameterized systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Compositionality of Hennessy-Milner logic by structural operational semantics
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
An Approach for the Specification, Verification and Synthesis of Secure Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Through Modeling to Synthesis of Security Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional verification of sequential programs with procedures
Information and Computation
Partial model checking via abstract interpretation
Information Processing Letters
Logical Specification and Analysis of Fault Tolerant Systems Through Partial Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Moby/DC - a tool for model-checking parametric real-time specifications
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Compositional analysis for verification of parameterized systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A tool for the synthesis of controller programs
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Synthesis of web services orchestrators in a timed setting
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Compositional and quantitative model checking (extended abstract)
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Parameterized verification of π-calculus systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Transformation of MTCCS into an extension of timed
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
Decompositional reasoning about the history of parallel processes
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Partial model checking using networks of labelled transition systems and boolean equation systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
From qualitative to quantitative enforcement of security policy
MMM-ACNS'12 Proceedings of the 6th international conference on Mathematical Methods, Models and Architectures for Computer Network Security: computer network security
A framework for automatic generation of security controller
Software Testing, Verification & Reliability
A tool for the synthesis of cryptographic orchestrators
Proceedings of the Workshop on Model-Driven Security
Bring your own device, securely
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
A major obstacle in applying finite-state model checking to the verification of large systems is the combinatorial explosion of the state space arising when many loosely coupled parallel processes are considered. The problem also known as the *state- explosion problem* has been attacked from various sides. This paper presents a new approach based on *partial model checking*: Parts of the concurrent system are gradually removed while transforming the specification accordingly. When the intermediate specifications constructed in this manner can be kept small, the state-explosion problem is avoided. Experimental results with a prototype implemented in Standard ML, shows that for Milner's Scheduler - an often used benchmark - this approach improves on the published results on Binary Decision Diagrams and is comparable to results obtained using generalized Decision Diagrams. Specifications are expressed in a variant of the modal mu- calculus.