scientific article; zbMATH DE number 1956575
From MaRDI portal
Publication:4417916
zbMath1031.68049MaRDI QIDQ4417916
E. Pascal Gribomont, Pascal Fontaine
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2619/26190097.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (4)
Symbolic backward reachability with effectively propositional logic. Application to security policy analysis ⋮ Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs ⋮ Combinations of Theories for Decidable Fragments of First-Order Logic ⋮ Decidable fragments of many-sorted logic
This page was built for publication:
