Sciweavers

2018 search results - page 127 / 404
» Code Normal Forms
Sort
View
ECEASST
2008
171views more  ECEASST 2008»
15 years 2 months ago
Type Checking C++ Template Instantiation by Graph Programs
Abstract: Templates are a language feature of C++ and can be used for metaprogramming. The metaprogram is executed by the compiler and outputs source code which is then compiled. T...
Karl Azab, Karl-Heinz Pennemann
115
Voted
ICSE
2009
IEEE-ACM
15 years 6 days ago
VCC: Contract-based modular verification of concurrent C
Most system level software is written in C and executed concurrently. Because such software is often critical for system reliability, it is an ideal target for formal verification...
Markus Dahlweid, Michal Moskal, Thomas Santen, Ste...
SCP
2010
123views more  SCP 2010»
14 years 9 months ago
Slicing for architectural analysis
Current software development often relies on non trivial coordination logic for combining autonomous services, eventually running on different platforms. As a rule, however, such ...
Nuno F. Rodrigues, Luís Soares Barbosa
CADE
2006
Springer
16 years 2 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
103
Voted
CADE
2001
Springer
16 years 2 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider