227 search results - page 28 / 46 » A Model Theory for Paraconsistent Logic Programming |
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
ATAL
2007
Springer
14 years 15 days ago
2007
Springer
Interactions between agents in an open system such as the Internet require a significant degree of flexibility. A crucial aspect of the development of such methods is the notion o...
CCS
2005
ACM
14 years 2 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
EMSOFT
2006
Springer
14 years 4 days ago
2006
Springer
Concurrent programming languages should be a good fit for embedded systems because they match the intrinsic parallelism of their architectures and environments. Unfortunately, typ...