Sciweavers

299 search results - page 5 / 60
» Mechanizing common knowledge logic using COQ
Sort
View
ECAI
2008
Springer
13 years 9 months ago
Partial and Informative Common Subsumers in Description Logics
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless foc...
Simona Colucci, Eugenio Di Sciascio, Francesco M. ...
ICFP
2009
ACM
14 years 8 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
APLAS
2009
ACM
14 years 2 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
PPDP
2007
Springer
14 years 1 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
COMSIS
2006
141views more  COMSIS 2006»
13 years 7 months ago
Common Web Application Attack Types and Security Using ASP.NET
Web applications security is one of the most daunting tasks today, because of security shift from lower levels of ISO OSI model to application level, and because of current situati...
Bojan Jovicic, Dejan Simic