Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science
Compositional verification of sequential programs with procedures
Information and Computation
Reasoning about nondeterministic and concurrent actions: a process algebra approach
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
CVPP: a tool set for compositional verification of control-flow safety properties
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Parametric modal transition systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On the expressiveness of refinement settings
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
WSCMon: runtime monitoring of web service orchestration based on refinement checking
Service Oriented Computing and Applications
Relating modal refinements, covariant-contravariant simulations and partial bisimulations
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Dual-Priced modal transition systems with time durations
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reducing behavioural to structural properties of programs with procedures
Theoretical Computer Science
Hennessy-Milner logic with greatest fixed points as a complete behavioural specification theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |