Filters








315,104 Hits in 3.7 sec

Automatic generation of compiled simulations through program specialization

Wing Yee Au, Daniel Weise, Scott Seligman
1991 Proceedings of the 28th conference on ACM/IEEE design automation conference - DAC '91  
Using a program specializer, we automatically generated high-performance digital simulation algorithms from a simple interpreter-based simulator.  ...  By making simple changes in the simulator and the specializer, we generated four types of compiled simulations: the PC-set algorithm, an improvement on the PC-set algorithm, and two compiled versions of  ...  Partial Evaluation and Simulation Partial evaluation converts a high-level program into a lowlevel program suited for a particular problem by specializing it with respect to some known data, or the structure  ... 
doi:10.1145/127601.127665 dblp:conf/dac/AuWS91 fatcat:n7p5yopl7bdhxeitmh2buznpvm

Experiments with implementations of two theoretical constructions [chapter]

Torben Amtoft Hansen, Thomas Nikolajsen, Jesper Larsson Träff, Neil D. Jones
1989 Lecture Notes in Computer Science  
Cook [4] has shown that any 2DPDA can be simulated in linear time by a clever memoization technique.  ...  Both have, however, a high computational overhead, since they in effect work by interpretation rather than compilation.  ...  Further work could also include partially evaluating the Cook interpreter with a known automaton and partially known input tape. Consider for example the substring program.  ... 
doi:10.1007/3-540-51237-3_11 fatcat:pbarycdobvbrfgwfztx25foiju

Semantics and reasoning with free procedures

Steven M. German
1992 Theoretical Computer Science  
If 9 is a programming language and I is an interpretation, we say that the 9 programs Zero, Succ, Add, and Mult partially simulate arithmetic in I iii there is a bijection 0: dam(Z) + N with the following  ...  If the programs Zero, Succ, Add, and Mult partially simulate arithmetic in Z and, moreover, each of the programs has a halting computation for each initial valuation of its program variables in Z, then  ... 
doi:10.1016/0304-3975(92)90387-u fatcat:nogieuptpbe47gzzv6vbydvxce

Incompleteness of relational simulations in the blocking paradigm

Eerke Boiten, John Derrick
2010 Science of Computer Programming  
This is known to be true for total relational specifications and has been claimed to hold for partial relational specifications in both the non-blocking and blocking interpretations.  ...  For specifications given in a relational formalism, downward and upward simulations are the standard method to verify that a refinement holds, their usefulness based upon their soundness and joint completeness  ...  Acknowledgements We would like to thank Steve Reeves and David Streader for coming up with a crucial counterexample and comments on this paper, and the anonymous reviewer of [2] who pointed us at their  ... 
doi:10.1016/j.scico.2010.07.003 fatcat:5fm5ym7tgjayrnfq7fjdnmvxeq

Generation of Executable Representation for Processor Simulation with Dynamic Translation

Jiajia Song, HongWei Hao, Claude Helmstetter, Vania Joloboff
2008 2008 International Conference on Computer Science and Software Engineering  
This paper presents a simulator where we have developed and integrated three techniques: an interpretive simulator and two variants of dynamic translation.  ...  These three methods have been used to run the same simulated programs and compare their performance.  ...  Interpretive simulation is used in Simplescalar [11] . , also called static translation. The application program is decoded at compile time and translated into a new program for the simulation host.  ... 
doi:10.1109/csse.2008.635 dblp:conf/csse/SongHHJ08 fatcat:nvtbs6rv6fej5kkbzob3sttl24

An Entailment Relation for Reasoning on the Web [chapter]

François Bry, Sebastian Schaffert
2003 Lecture Notes in Computer Science  
As a consequence, additional data processing like data conversion from Web formats (e.g.  ...  Finally, it discusses how the proposed entailment can be used in applying logic programming to reasoning on the Web.  ...  Thus, interpretations must be closed under rooted simulation: if I is an interpretation, E ∈ I, and E is a semistructured expression simulated in E, then E ∈ I.  ... 
doi:10.1007/978-3-540-39715-1_2 fatcat:ceurvl3eyvgjlb6ic23bt2omba

Logimix: A Self-Applicable Partial Evaluator for Prolog [chapter]

Torben Æ. Mogensen, Anders Bondorf
1993 Logic Program Synthesis and Transformation  
We have successfully applied Logimix to interpreters, yielding compiled programs where virtually all interpretation overhead is removed.  ...  We present a self-applicable partial evaluator for a large subset of full Prolog.  ...  If a particular program should require such a change to get good results from partial evaluation, this can be simulated by introducing new variables.  ... 
doi:10.1007/978-1-4471-3560-9_15 dblp:conf/lopstr/MogensenB92 fatcat:vr3slzmydjakhgvlk7cnbudc4q

Verification via Structure Simulation [chapter]

Niel Immerman, Alexander Rabinovich, Thomas W. Reps, Mooly Sagiv, Great Yorsh
2004 Lecture Notes in Computer Science  
From these annotations, a formula ϕ is generated, called the verification condition of the program; ϕ is valid if and only if the program is partially correct.  ...  In this section, we illustrate the simulation technique by showing its applicability to semi-automatic Hoare-style verification.  ...  The vocabulary τ Rep includes one binary relation symbol, E, which must be interpreted by a relation that is a partial function. Arbitrary unary relation symbols and constant symbols may be included.  ... 
doi:10.1007/978-3-540-27813-9_22 fatcat:xphcjvwsh5gezajsaooxwxbnm4

Preferred answer sets for ordered logic programs

DAVY VAN NIEUWENBORGH, DIRK VERMEIR
2006 Theory and Practice of Logic Programming  
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a "best" answer set.  ...  Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones  ...  We show that the semantics thus obtained can be simulated by an extended logic program the rules induces a natural partial order on the reducts of the program, and hence on its candidate answer sets.  ... 
doi:10.1017/s1471068404002315 fatcat:35lzz6can5e3pa3v7rxtjrrmcm

Preferred Answer Sets for Ordered Logic Programs [chapter]

Davy Van Nieuwenborgh, Dirk Vermeir
2002 Lecture Notes in Computer Science  
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a "best" answer set.  ...  Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a preference for satisfying certain rules, possibly at the cost of violating less important ones  ...  We show that the semantics thus obtained can be simulated by an extended logic program the rules induces a natural partial order on the reducts of the program, and hence on its candidate answer sets.  ... 
doi:10.1007/3-540-45757-7_36 fatcat:z34yqiihr5h4hmawclmdklnnxe

Assertional Data Reification Proofs: Survey and Perspective [chapter]

J. Coenen, W.-P. de Roever, J. Zwiers
1991 Workshops in Computing  
Suppose that Sf simulates Sf and Sf simulates st, and P is a program with statements Sf and S{ Then P with Sf and st replaced by Sf and Sf should also simulate P.  ...  Observe also that VDM correctness formulae are interpreted as partial correctness formulae, which is unlike the total correctness interpretation in e.g. [VDM89].  ...  A compositional proof system for dynamic proces creation, p. 24.  ... 
doi:10.1007/978-1-4471-3756-6_5 fatcat:rveeh2x5gvfd5f4tdoanx4y4ki

Instruction set compiled simulation

Mehrdad Reshadi, Prabhat Mishra, Nikil Dutt
2003 Proceedings of the 40th conference on Design automation - DAC '03  
This paper presents a novel technique for generation of fast instruction-set simulators that combines the benefit of both compiled and interpretive simulation.  ...  Interpretive simulators are flexible but slow, whereas compiled simulators deliver speed at the cost of flexibility.  ...  The effect of partial evaluation is to specialize a program with part of its input to get a faster version of the same program.  ... 
doi:10.1145/775832.776026 dblp:conf/dac/ReshadiMD03 fatcat:nlxudj6tcva2dkandc7ponu7kq

Simulation of specification statements in Hoare logic [chapter]

Kai Engelhardt, Willem-Paul Roever
1996 Lecture Notes in Computer Science  
Specification statements represent the maximal program satisfying a given Hoare-triple. Sound and (relatively) complete simulation techniques allow for proving data refinement by local arguments.  ...  A major challenge for simulation consists of expressing the weakest lower level specification simulating a given higher level specification w.r.t. a given relation between these two levels of abstraction  ...  Symbol is pronounced as "refines" and interpreted as relational inclusion. It is a partial order on relational terms. The most general program S satisfying Hoare-triple f gSf g is ; by (4).  ... 
doi:10.1007/3-540-61550-4_159 fatcat:m2xyjorxnvhgxjqjvvblms5buy

Page 97 of Management Science Vol. 6, Issue 1 [page]

1959 Management Science  
itself, and even allowed a time saving by permitting the reuse of a file of job cards for different runs of the simulator.  ...  Similarly, output information was obtained by sampling and this was punched in raw form to be reloaded as input to a separate reduction and analysis program.  ... 

Compiling away the meta-level in object-oriented concurrent reflective languages using partial evaluation

Hidehiko Masuhara, Satoshi Matsuoka, Kenichi Asai, Akinori Yonezawa
1995 Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications - OOPSLA '95  
Since traditional partial evaluators do not allow us to directly deal with meta-circular interpreters written with concurrent objects, we devised techniques such as pre-/post-processing, a new proposed  ...  To solve this problem, we propose a compilation framework for object-oriented concurrent reflective languages using partial evaluation.  ...  The meta-level program and its compiled code in the Meta case are given in Appendix A. N-Body Simulation The second base-level application is a parallel Barnes-Hut N-body simulation algorithm.  ... 
doi:10.1145/217838.217869 dblp:conf/oopsla/MasuharaMAY95 fatcat:6zdaxagrbnhz3bmlh7ueicpirq
« Previous Showing results 1 — 15 out of 315,104 results