Sciweavers

756 search results - page 94 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
JFP
2007
111views more  JFP 2007»
15 years 6 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
ICALP
2007
Springer
16 years 21 days ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
FMCAD
2000
Springer
15 years 10 months ago
The Semantics of Verilog Using Transition System Combinators
Abstract. Since the advent of model checking it is becoming more common for languages to be given a semantics in terms of transition systems. Such semantics allow to model check pr...
Gordon J. Pace
POPL
2006
ACM
16 years 6 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
PPOPP
2006
ACM
16 years 15 days ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...