Sciweavers

4257 search results - page 369 / 852
» The Logical Modularity of Programs
Sort
View
POPL
2008
ACM
16 years 7 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
PLDI
2012
ACM
13 years 9 months ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
APAL
2006
112views more  APAL 2006»
15 years 6 months ago
On complexity of verification of interacting agents' behavior
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
GPCE
2005
Springer
16 years 6 days ago
Language Requirements for Large-Scale Generic Libraries
Abstract. The past decade of experience has demonstrated that the generic programming methodology is highly effective for the design, implementation, and use of large-scale softwar...
Jeremy G. Siek, Andrew Lumsdaine
181
Voted
RIA
2007
123views more  RIA 2007»
15 years 6 months ago
Continuations pour la programmation de comportement d'agent
Continuations are a well established programming concept that allows capturing and resuming the current program state. They can be found in several functional programming languages...
Denis Jouvin