Sciweavers

4722 search results - page 277 / 945
» Representation-independent program analysis
Sort
View
PPOPP
2003
ACM
15 years 11 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra
CP
1998
Springer
15 years 10 months ago
A Framework for Assertion-Based Debugging in Constraint Logic Programming
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
Germán Puebla, Francisco Bueno, Manuel V. H...
FPCA
1995
15 years 10 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
IJNSEC
2007
119views more  IJNSEC 2007»
15 years 6 months ago
Evolutionary Design of Intrusion Detection Programs
Intrusion detection is the process of monitoring the events occurring in a computer system or network and analyzing them for signs of intrusions, defined as attempts to compromis...
Ajith Abraham, Crina Grosan, Carlos Martín-...
POPL
2007
ACM
16 years 6 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...