Sciweavers

565 search results - page 83 / 113
» A (De)constructive Approach to Program Checking
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...
Dominik Steenken, Heike Wehrheim, Daniel Wonisch
FORTE
2009
13 years 6 months ago
Typing Component-Based Communication Systems
Abstract. Building complex component-based software systems, for instance communication systems based on the Click, Coyote, Appia, or Dream frameworks, can lead to subtle assemblag...
Michael Lienhardt, Claudio Antares Mezzina, Alan S...
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 2 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
CONCUR
1999
Springer
14 years 28 days ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
CC
2006
Springer
108views System Software» more  CC 2006»
14 years 11 days ago
Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers
This paper presents a new worklist algorithm that significantly speeds up a large class of flow-sensitive data-flow analyses, including typestate error checking and pointer analysi...
Teck Bok Tok, Samuel Z. Guyer, Calvin Lin