Automatic Verification of Concurrent Ada Programs
Ada-Europe '99 Proceedings of the 1999 Ada-Europe International Conference on Reliable Software Technologies
A Group Based Approach for Coordinating Active Objects
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
A historical perspective on runtime assertion checking in software development
ACM SIGSOFT Software Engineering Notes
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
ACM Transactions on Software Engineering and Methodology (TOSEM)
Learning to divide and conquer: applying the L* algorithm to automate assume-guarantee reasoning
Formal Methods in System Design
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
D-finder 2: towards efficient correctness of incremental design
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Incremental component-based construction and verification using invariants
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Hypergraph partitioning for the parallel computation of continuous Petri nets
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Data and abstraction for scenario-based modeling with petri nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Parallel computation of continuous Petri nets based on hypergraph partitioning
The Journal of Supercomputing
| Hi-index | 0.00 |
Debuggers for parallel programs have to be more than passive information gatherers-they should automatically detect errors. Powerful task debuggers for Ada can be constructed by extending existing tools that detect deadlock.