271 search results - page 10 / 55 » Observational Completeness on Abstract Interpretation |
TACS
1994
Springer
13 years 10 months ago
1994
Springer
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...
TOPNOC
2008
13 years 6 months ago
2008
Abstract. In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finitestate) Petri nets, which can be used ...
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
FASE
2008
Springer
13 years 8 months ago
2008
Springer
For a number of programming languages, among them Eiffel, C, Java and Ruby, Hoare-style logics and dynamic logics have been developed. In these logics, pre- and postconditions are ...
QOSA
2010
Springer
13 years 10 months ago
2010
Springer
Software performance engineering (SPE) enables software architects to ensure high performance standards for their applications. However, applying SPE in practice is still challengi...