4814 search results - page 656 / 963 » Combining abstract interpreters |
143
Voted
CADE
2006
Springer
16 years 5 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
167
Voted
CADE
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
151
click to vote
ICFP
2002
ACM
16 years 5 months ago
2002
ACM
Monads are a useful abstraction of computation, as they model diverse computational effects such as stateful computations, exceptions and I/O in a uniform manner. Their potential ...
144
Voted
PADL
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
155
click to vote
PADL
2010
Springer
16 years 2 months ago
2010
Springer
Abstract. We study a number of embedded DSLs for autonomous ordinary differential equations (autonomous ODEs) in Haskell. A naive implementation based on the lazy tower of derivat...