Sciweavers

125 search results - page 13 / 25
» Transforming Normal Programs by Replacement
Sort
View
FASE
2008
Springer
13 years 9 months ago
Software Quality Improvement Via Pattern Matching
Abstract. Nested if-then-else statements is the most common programming schema in applications like data transformation or data analysis. In most cases, these can be replaced by hi...
Radu Kopetz, Pierre-Etienne Moreau
ICLP
2001
Springer
13 years 12 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
FM
2008
Springer
75views Formal Methods» more  FM 2008»
13 years 9 months ago
Masking Faults While Providing Bounded-Time Phased Recovery
We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
LICS
1994
IEEE
13 years 11 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
APLAS
2004
ACM
14 years 25 days ago
Network Fusion
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
Pascal Fradet, Stéphane Hong Tuan Ha