Sciweavers

60 search results - page 6 / 12
» Loop Formulas for Circumscription
Sort
View
PTS
2010
175views Hardware» more  PTS 2010»
13 years 5 months ago
Test Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
Christoph Gladisch
CSR
2010
Springer
14 years 13 days ago
Prehistoric Phenomena and Self-referentiality
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : ϕ(t), which have self-referential meanings. In this paper, “prehistoric phenomena...
Junhua Yu
ISSTA
2000
ACM
14 years 9 hour ago
Finding bugs with a constraint solver
A method for finding bugs in code is presented. For given small numbers j and k, the code of a procedure is translated into a relational formula whose models represent all executi...
Daniel Jackson, Mandana Vaziri
ICSOC
2010
Springer
13 years 5 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
KBSE
2007
IEEE
14 years 1 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid