Sciweavers

432 search results - page 55 / 87
» On Notions of Regularity for Data Languages
Sort
View
PLDI
2011
ACM
12 years 10 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
POPL
2008
ACM
14 years 8 months ago
Foundations for structured programming with GADTs
GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood. In ...
Patricia Johann, Neil Ghani
LISP
2008
96views more  LISP 2008»
13 years 7 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
FASE
2004
Springer
14 years 1 months ago
Reasoning about Card Tears and Transactions in Java Card
The Java dialect Java Card for programming smartcards contains some features which do not exist in Java. Java Card distinguishes persistent and transient data (data stored in EEPRO...
Engelbert Hubbers, Erik Poll
JCST
2010
153views more  JCST 2010»
13 years 2 months ago
Model Failure and Context Switching Using Logic-Based Stochastic Models
Abstract We define a notion of context that represents invariant, stable-over-time behavior in an environment and we propose an algorithm for detecting context changes in a stream ...
Nikita A. Sakhanenko, George F. Luger