Sciweavers

2702 search results - page 59 / 541
» Practically Applicable Formal Methods
Sort
View
ICFEM
2009
Springer
14 years 7 months ago
The VSE Refinement Method in Hets
We present the integration of refinement method of VSE verification tool, successfully used in industrial applications, in the Heterogeneous Tool Set HETS. The connection is done v...
Mihai Codescu, Bruno Langenstein, Christian Maeder...
EDBT
2008
ACM
111views Database» more  EDBT 2008»
15 years 10 months ago
Schema polynomials and applications
Conceptual complexity is emerging as a new bottleneck as data-base developers, application developers, and database administrators struggle to design and comprehend large, complex...
Kenneth A. Ross, Julia Stoyanovich
TPHOL
2007
IEEE
15 years 4 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
DAC
2005
ACM
15 years 10 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ENTCS
2006
145views more  ENTCS 2006»
14 years 9 months ago
Compositionality of Security Protocols: A Research Agenda
The application of formal methods to security protocol analysis has been extensively researched during the last 25 years. Several formalisms and (semi-)automatic tools for the ver...
Cas J. F. Cremers