Sciweavers

1445 search results - page 212 / 289
» Abstract Interpretation of Logic Programs
Sort
View
ICFP
2005
ACM
15 years 9 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
SIGCSE
2009
ACM
137views Education» more  SIGCSE 2009»
15 years 10 months ago
The hidden injuries of overloading 'ADT'
commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, lik...
Duane Buck, David J. Stucki
POPL
2007
ACM
15 years 10 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
AGENTCL
2000
Springer
15 years 2 months ago
Operational Semantics for Agent Communication Languages
Abstract. In this paper, we study the operational semantics of agent communication languages.We develop a basic multi-agent programming language for systems of concurrently operati...
Rogier M. van Eijk, Frank S. de Boer, Wiebe van de...
CAV
2005
Springer
150views Hardware» more  CAV 2005»
15 years 3 months ago
Reasoning About Threads Communicating via Locks
Abstract. We propose a new technique for the static analysis of concurrent programs comprised of multiple threads. In general, the problem is known to be undecidable even for progr...
Vineet Kahlon, Franjo Ivancic, Aarti Gupta