Sciweavers

1101 search results - page 204 / 221
» Forcing in proof theory
Sort
View
ICTAC
2010
Springer
13 years 6 months ago
Preference and Non-deterministic Choice
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Bill Stoddart, Frank Zeyda, Steve Dunne
VIS
2005
IEEE
109views Visualization» more  VIS 2005»
14 years 8 months ago
Topological Structures of 3D Tensor Fields
Tensor topology is useful in providing a simplified and yet detailed representation of a tensor field. Recently the field of 3D tensor topology is advanced by the discovery that d...
Xiaoqiang Zheng, Beresford N. Parlett, Alex Pang
SIGSOFT
2007
ACM
14 years 8 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
ECOOP
2009
Springer
14 years 8 months ago
Failboxes: Provably Safe Exception Handling
The primary goal of exception mechanisms is to help ensure that when an operation fails, code that depends on the operation's successful completion is not executed (a property...
Bart Jacobs 0002, Frank Piessens
POPL
2008
ACM
14 years 7 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan