Filters








104,444 Hits in 3.9 sec

A Program Transformation for Tracing Functional Logic Computations [chapter]

Bernd Brassel, Sebastian Fischer, Frank Huch
Logic-Based Program Synthesis and Transformation  
In previous work we developed an extension of a heap based semantics for functional logic languages which generates a trace reflecting the computation of the program.  ...  Tracing program executions is a promising technique to find bugs in lazy functional logic programs.  ...  At the moment we are working on tracing external functions and want to implement a module-wise transformation with a trusting mechanism for selected modules.  ... 
doi:10.1007/978-3-540-71410-1_12 dblp:conf/lopstr/BrasselFH06 fatcat:qnl7sam5lza5vig5d35bm6hkue

Page 5676 of Mathematical Reviews Vol. , Issue 93j [page]

1993 Mathematical Reviews  
It was developed as a vehicle for research into the synthesis of digital logic, but is equally suitable for reasoning about functional programs.  ...  Summary: “This paper proposes a new language, formal LISP, for expressing and reasoning about traces of computer programs.  ... 

Defining concurrent processes constructively

Yukihide Takayama
1994 Theoretical Computer Science  
The logic is defined by adding stream types and several rules for them to a simple constructive logic based on intuitionism.  ...  Several techniques for defining stream-based concurrent programs are also presented through various examples. to as constructive programming' in the following.  ...  He also thanks the referees for their useful advice and for pointing out various errors.  ... 
doi:10.1016/0304-3975(94)90205-4 fatcat:fh6k2wcdlzfrjojczzonwwzbey

Using Logic Coverage to Improve Testing Function Block Diagrams [chapter]

Eduard Paul Enoiu, Daniel Sundmark, Paul Pettersson
2013 Lecture Notes in Computer Science  
We show how logic coverage criteria can be formalized and used by a model-checker to provide test cases for ensuring coverage on safety-critical software described in the Function Block Diagram programming  ...  Based on our experiments, this approach, supported by a tool chain, is an applicable and useful way of generating test cases for covering Function Block Diagrams.  ...  The authors would like to thank Elaine Weyuker and Thomas Ostrand for their valuable comments on this work.  ... 
doi:10.1007/978-3-642-41707-8_1 fatcat:2h2muckhz5gs5fukc7jwsahqxy

A Framework for Interpreting Traces of Functional Logic Computations

Bernd Braßel
2007 Electronical Notes in Theoretical Computer Science  
This paper is part of a comprehensive approach to debugging for functional logic languages.  ...  The basic idea of the whole project is to trace the execution of functional logic programs by side effects and then give different views on the recorded data.  ...  [26] for logic, [22, 23] for functional, [10] for functional logic programming), observations for lazy languages (cf.  ... 
doi:10.1016/j.entcs.2007.01.006 fatcat:6g7k6snunbfblkgdq54c5dvuuq

Page 2371 of Mathematical Reviews Vol. , Issue 95d [page]

1995 Mathematical Reviews  
Harmer, Practical transformation of functional programs for efficient exe- cution: a case study (62-88); Martin S.  ...  A bound on efficiency gain by folding/unfolding transformations is obtained for all reasonable computation models.  ... 

A semantics for tracing declarative multi-paradigm programs

B. Brassel, M. Hanus, F. Huch, G. Vidal
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry.  ...  In contrast to previous approaches, which rely solely on a transformation to instrument source programs, the formal definition of a tracing semantics improves the understanding of the tracing process.  ...  Acknowledgments We would like to thank Santiago Escobar for many helpful comments and discussions on an earlier version of this paper.  ... 
doi:10.1145/1013963.1013984 dblp:conf/ppdp/BrasselHHV04 fatcat:o6yzgdowyjcenm7uqho5ku5f7a

The automated proof of a trace transformation for a bitonic sort

Chua-Huang Huang, Christian Lengauer
1986 Theoretical Computer Science  
We develop a program for the bitonic sort by (1) deriving a stepwise refinement from Knuth's informal description of the algorithm, (2) deriving from the refinement a sequential execution or 'trace' of  ...  This work is a contribution to the optimization of programs (via concurrency) through transformation and the automation of program proofs.  ...  Acknowledgment We are grateful to the attendants of the Fall 1984 Boyer-Moore Verification Seminar for critical comments that helped improve the presentation of this proof.  ... 
doi:10.1016/0304-3975(86)90033-2 fatcat:ifteoxfabjgpxbqvbj3wlcdnti

Formally Verifying Dynamic Properties of Knowledge Based Systems [chapter]

Perry Groot, Annette ten Teije, Frank van Harmelen
1999 Lecture Notes in Computer Science  
We present a case-study of a simple classification method for which we formulate and verify two dynamic properties which are concerned with the anytime behaviour and the computation trace of the classification  ...  We show how Dynamic Logic can be used to formally express these dynamic properties.  ...  Finally, for both case studies we have suggested a general approach that could be applied to other problem solving methods in order to obtain the same results for those methods.  ... 
doi:10.1007/3-540-48775-1_10 fatcat:qxjsiqiiljaidp5p26r2kanqca

Declarative Debugging Meets the World

Wolfgang Lux
2008 Electronical Notes in Theoretical Computer Science  
However, this transformation does not mix well with monadic I/O, which is used by lazy functional and functional logic languages.  ...  Declarative debuggers are usually described and implemented by means of a program transformation.  ...  The standard program transformation for functional logic programs, on which our transformation is based, was introduced and proven sound in [1, 3] .  ... 
doi:10.1016/j.entcs.2008.06.034 fatcat:gcguvrwxfzgobj4cssdirjmpze

Page 1647 of Mathematical Reviews Vol. , Issue 85d [page]

1985 Mathematical Reviews  
Regular trace logic is a new logic which can be used to give behavioural specifications for concurrent systems (e.g., P. Wolper, but with significant dif- ferences).  ...  VLSI is a medium for the execution of computations.  ... 

Page 6322 of Mathematical Reviews Vol. , Issue 93k [page]

1993 Mathematical Reviews  
two actions a and b are concurrent and the logics are intepreted over trace systems, then they are undecidable.  ...  In this paper we show that if propositional versions of partial order logic (POL), interleaving set temporal logic (ISTL), or concurrent computation tree logic (CCTL) allow for specifying directly that  ... 

Counterexample-guided focus

Andreas Podelski, Thomas Wies
2010 Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '10  
Our idea is to use counterexamples for this purpose. We realize this idea in a tool that automatically infers quantified invariants for the verification of a variety of heapmanipulating programs.  ...  We fine-tune the focus operator to each individual step of the analysis (for a specific verification task). This fine-tuning must be done automatically.  ...  A trace is called error trace if it is the trace of some computation that reaches an error state. A program is safe if it has no error traces. Predicate transformers.  ... 
doi:10.1145/1706299.1706330 dblp:conf/popl/PodelskiW10 fatcat:h2s3vpjnenf3rdrmzq3cfos4vq

Counterexample-guided focus

Andreas Podelski, Thomas Wies
2010 SIGPLAN notices  
Our idea is to use counterexamples for this purpose. We realize this idea in a tool that automatically infers quantified invariants for the verification of a variety of heapmanipulating programs.  ...  We fine-tune the focus operator to each individual step of the analysis (for a specific verification task). This fine-tuning must be done automatically.  ...  A trace is called error trace if it is the trace of some computation that reaches an error state. A program is safe if it has no error traces. Predicate transformers.  ... 
doi:10.1145/1707801.1706330 fatcat:lmff57fldra47cshszf35zlqrq

Structuring Optimizing Transformations and Proving Them Sound

Aditya Kanade, Amitabha Sanyal, Uday Khedker
2007 Electronical Notes in Theoretical Computer Science  
We express both in a temporal logic. We also develop a logic called temporal transformation logic to correlate temporal properties over a program (seen as a Kripke structure) and its transformation.  ...  The program analysis required for optimization is defined over the input program whereas the soundness conditions of a transformation primitive need to be shown on the version of the program on which it  ...  Acknowledgement Authors wish to thank Supratik Chakraborty for many insightful discussions. Authors are thankful to César Muñoz for clarifying PVS related doubts.  ... 
doi:10.1016/j.entcs.2006.06.018 fatcat:lejwwzmilfeohjxjxxk7t47jjy
« Previous Showing results 1 — 15 out of 104,444 results