Sciweavers

447 search results - page 18 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
ECOOP
1999
Springer
15 years 1 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
79
Voted
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
15 years 2 months ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda
FLAIRS
2009
14 years 7 months ago
Analyzing Team Actions with Cascading HMM
While team action recognition has a relatively extended literature, less attention has been given to the detailed realtime analysis of the internal structure of the team actions. ...
Brandyn Allen White, Nate Blaylock, Ladislau B&oum...
FSTTCS
2010
Springer
14 years 6 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
SAT
2004
Springer
85views Hardware» more  SAT 2004»
15 years 2 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz