Sciweavers

5506 search results - page 656 / 1102
» Minimal Logic Programs
Sort
View
FASE
2010
Springer
16 years 1 months ago
A Lightweight and Portable Approach to Making Concurrent Failures Reproducible
Multithreaded concurrent programs often exhibit bugs due to unintended interferences among the concurrent threads. Such bugs are often hard to reproduce because they typically hap...
Qingzhou Luo, Sai Zhang, Jianjun Zhao, Min Hu
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
16 years 12 days ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...
202
Voted
CCS
2005
ACM
16 years 11 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
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...
Santiago Escobar, Catherine Meadows, José M...
ICLP
2009
Springer
16 years 7 months ago
Incremental Answer Completion in the SLG-WAM
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
Alexandre Miguel Pinto, Luís Moniz Pereira,...
ICFP
2005
ACM
16 years 6 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power