Sciweavers

1686 search results - page 84 / 338
» Programs as polygraphs: computability and complexity
Sort
View
PEPM
2009
ACM
15 years 8 months ago
Guided model checking for programs with polymorphism
Exhaustive model checking search techniques are ineffective for error discovery in large and complex multi-threaded software systems. Distance estimate heuristics guide the concre...
Neha Rungta, Eric G. Mercer
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
14 years 11 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
IJCAI
2001
15 years 1 months ago
IBAL: A Probabilistic Rational Programming Language
In a rational programming language, a program specifies a situation faced by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the...
Avi Pfeffer
IEEEPACT
1999
IEEE
15 years 4 months ago
Containers on the Parallelization of General-Purpose Java Programs
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
Peng Wu, David A. Padua
POPL
2010
ACM
15 years 9 months ago
Compositional May-Must Program Analysis: Unleashing the Power of Alternation
Program analysis tools typically compute two types of information: (1) may information that is true of all program executions and is used to prove the absence of bugs in the progr...
Aditya V. Nori, Patrice Godefroid, SaiDeep Tetali,...