8132 search results - page 179 / 1627 » Dependability, Abstraction, and Programming |
203
Voted
ACMMSP
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
212
Voted
TACS
1994
Springer
15 years 10 months ago
1994
Springer
Abstract Interpretation for Control-Flow Analysis Yan Mei Tang and Pierre Jouvelot CRI, Ecole des Mines de Paris, France Effect systems and abstract interpretation are two methods ...
173
Voted
AMAST
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present several formal program refinement rules for designing multi-tasking programs with hard real-time constraints.
172
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
182
Voted
APLAS
2005
ACM
16 years 3 days ago
2005
ACM
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...