Sciweavers

662 search results - page 103 / 133
» Logic Programming with Ordered Disjunction
Sort
View
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 4 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
ICSE
2004
IEEE-ACM
14 years 7 months ago
Efficient Decentralized Monitoring of Safety in Distributed Systems
We describe an efficient decentralized monitoring algorithm that monitors a distributed program's execution to check for violations of safety properties. The monitoring is ba...
Koushik Sen, Abhay Vardhan, Gul Agha, Grigore Rosu
ECAIW
1994
Springer
13 years 11 months ago
Representing and Executing Agent-Based Systems
Abstract. In this paper we describe an approach to the representation and implementation of agent-based systems where the behaviour of an individual agent is represented by a set o...
Michael Fisher
JUCS
2006
104views more  JUCS 2006»
13 years 7 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
POPL
2007
ACM
14 years 7 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell