Sciweavers

828 search results - page 147 / 166
» Bounded Hairpin Completion
Sort
View
FMICS
2006
Springer
14 years 11 days ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
CASES
2005
ACM
13 years 10 months ago
MTSS: multi task stack sharing for embedded systems
Out-of-memory errors are a serious source of unreliability in most embedded systems [22]. Applications run out of main memory because of the frequent difficulty of estimating the ...
Bhuvan Middha, Matthew Simpson, Rajeev Barua
COMPGEOM
2008
ACM
13 years 10 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
VISSYM
2004
13 years 10 months ago
Isosurface Computation Made Simple
This paper presents a simple approach for rendering isosurfaces of a scalar field. Using the vertex programming capability of commodity graphics cards, we transfer the cost of com...
Valerio Pascucci
JFP
2007
136views more  JFP 2007»
13 years 8 months ago
Practical type inference for arbitrary-rank types
Haskell’s popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. ...
Simon L. Peyton Jones, Dimitrios Vytiniotis, Steph...