Filters








206,932 Hits in 7.1 sec

Classical logic, continuation semantics and abstract machines

Th. STREICHER, B. REUS
1998 Journal of functional programming  
weak head normal forms of λ-terms.  ...  The resulting abstract machine appears as an extension of Krivine's machine implementing head reduction.  ...  Extended Krivine's machine and its computational adequacy Now we define an extension of Krivine's machine computing head normal forms instead of only weak head normal forms.  ... 
doi:10.1017/s0956796898003141 fatcat:zj4uo6lwejehrotgvdc4ncpccm

Behavior Abstraction in Malware Analysis [chapter]

Philippe Beaucamps, Isabelle Gnaedig, Jean-Yves Marion
2010 Lecture Notes in Computer Science  
We present an approach for proactive malware detection working by abstraction of program behaviors.  ...  The expressive power of abstraction allows us to handle general suspicious behaviors rather than specific malware code and then, to detect malware mutations.  ...  We extend trace language normalization to a set of regular behavior patterns, and the trace language L is now normalized with → C into the abstract trace language L ↓ C . Theorem 2.  ... 
doi:10.1007/978-3-642-16612-9_14 fatcat:ux7leq3kz5aerapenzqjczeua4

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification [chapter]

Tristan Le Gall, Bertrand Jeannet
2007 Lecture Notes in Computer Science  
We apply this abstract lattice for the verification of symbolic communicating machines, and we discuss its usefulness for interprocedural analysis.  ...  The abstract representation is based on lattice automata, which are finite automata labeled by elements of an atomic lattice.  ...  This model is similar to other models like Extended Communicating Finite-State Machines [26] or Parametrized Communicating Finite-State Machines [27] . Syntax.  ... 
doi:10.1007/978-3-540-74061-2_4 fatcat:x3aeq7y775avzc3zjiol3jgkwe

Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines [article]

Małgorzata Biernacka and Dariusz Biernacki and Sergueï Lenglet and Piotr Polesiuk and Damien Pous and Alan Schmitt
2022 arXiv   pre-print
abstraction of the encodings.  ...  We consider several equivalences on the λ-calculus side – normal-form bisimilarity, applicative bisimilarity, and contextual equivalence – that we internalize into abstract machines in order to prove full  ...  We extend closures to include testing environments η ∶∶= (t, e, ∆, Φ), and we say that η is of rank φ when its testing environment is of rank φ.  ... 
arXiv:2205.06665v2 fatcat:cdqwxd7hivfyll422q7krflz6y

A Study of Syntactic and Semantic Artifacts and its Application to Lambda Definability, Strong Normalization, and Weak Normalization in the Presence of..

Johan Munk
2008 BRICS Report Series  
We give a new account of Felleisen and Hieb's syntactic theory of state, and of abstract machines for strong normalization due to Curien, Crégut, Lescanne, and Kluge.  ...  In this area, we present a course-of-value representation bridging Church numerals and Scott numerals. We then turn to weak and strong normalization using Danvy et al.'  ...  Our notion of an abstract machine An abstract machine M is a state-transition system.  ... 
doi:10.7146/brics.v15i3.21938 fatcat:jaibmuzs55ftponzsit7y5wpx4

On the Equivalence between Small-Step and Big-Step Abstract Machines: A Simple Application of Lightweight Fusion

Olivier Danvy, Kevin Millikin
2007 BRICS Report Series  
We show how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence of the two standard styles of specification of abstract machines: (1) in  ...  small-step form, as a state-transition function together with a 'driver loop,' i.e., a function implementing the iteration of this transition function; and (2) in big-step form, as a tail-recursive function  ...  Acknowledgments: Thanks are due to Ma lgorzata Biernacka, Kristian Støvring, and the anonymous reviewers of IPL for comments.  ... 
doi:10.7146/brics.v14i16.21935 fatcat:tilw45tzozdclog6bmh46a3nni

From Reduction-Based to Reduction-Free Normalization [chapter]

Olivier Danvy
2009 Lecture Notes in Computer Science  
and abstract machines.  ...  of the CPS transformation), ending with a reduction-free normalization function of the kind usually crafted by hand.  ...  Acknowledgments: These lecture notes are a revised and substantially expanded version of an invited talk at WRS 2004 [21] , for which the author is still grateful to Sergio Antoy and Yoshihito Toyama.  ... 
doi:10.1007/978-3-642-04652-0_3 fatcat:ybiugnlkovfipimsal5zm2kuo4

From Reduction-Based to Reduction-Free Normalization

Olivier Danvy
2004 BRICS Report Series  
<br /> <br />The construction builds on previous work on refocusing and on a functional correspondence between evaluators and abstract machines. It is also reversible.  ...  We present a systematic construction of a reduction-free normalization function.  ...  Acknowledgments: These lecture notes are a revised and substantially expanded version of an invited talk at WRS 2004 [21] , for which the author is still grateful to Sergio Antoy and Yoshihito Toyama.  ... 
doi:10.7146/brics.v11i30.21855 fatcat:qo5os4y2tvhubk5hmh23nh3lcu

An Object-Oriented Abstract Machine as the Substrate for an Object-Oriented Operating System [chapter]

Darío Álvarez Gutiérrez, Lourdes Tajes Martínez, Fernando Álvarez García, María Ángeles Díaz Fondón, Raúl Izquierdo Castanedo, Juan Manuel Cueva Lovelle
1998 Lecture Notes in Computer Science  
Using an object-oriented abstract machine brings a number of benefits for the construction of an object-oriented operating system.  ...  In this paper we describe the structure of an abstract machine designed for this task. This machine provides the basic object model and support for the rest of the system.  ...  Some of the features of the abstract machine imply several immediate advantages for distribution: ? Unique object identifier.  ... 
doi:10.1007/3-540-69687-3_95 fatcat:jtqqlr6zfjegtkazc4wbhfg6re

A compiled implementation of strong reduction

Benjamin Grégoire, Xavier Leroy
2002 Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP '02  
Our approach is based on compilation to the bytecode of an abstract machine performing weak reductions on non-closed terms, derived with minimal modifications from the ZAM machine used in the Objective  ...  An implementation in the Coq proof assistant demonstrates important speedups compared with the original interpreter-based implementation of strong reduction in Coq.  ...  Acknowledgments Henri Laulhère conducted preliminary experiments on modifying the Objective Caml compiler to implement strong normalization circa 1998; the results of these experiments were communicated  ... 
doi:10.1145/581478.581501 dblp:conf/icfp/GregoireL02 fatcat:hyc6jim7rreu3jfllyghftt3ii

A compiled implementation of strong reduction

Benjamin Grégoire, Xavier Leroy
2002 SIGPLAN notices  
Our approach is based on compilation to the bytecode of an abstract machine performing weak reductions on non-closed terms, derived with minimal modifications from the ZAM machine used in the Objective  ...  An implementation in the Coq proof assistant demonstrates important speedups compared with the original interpreter-based implementation of strong reduction in Coq.  ...  Acknowledgments Henri Laulhère conducted preliminary experiments on modifying the Objective Caml compiler to implement strong normalization circa 1998; the results of these experiments were communicated  ... 
doi:10.1145/583852.581501 fatcat:uftwfjnttve7bbxcdzfts6tb4i

A practical and flexible flow analysis for higher-order languages

J. Michael Ashley
1996 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96  
The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator.  ...  The analysis described in this article unifies and extends previous work on flow analyses for higher-order languages supporting assignment and control operators.  ...  In the specification, P(A) denotes the powerset of A. A state in the abstract machine consists of a term, an environment, a store, a cache, and a pending set.  ... 
doi:10.1145/237721.237773 dblp:conf/popl/Ashley96 fatcat:xl3qtyapsbfflbv6nh5naykdle

A practical and flexible flow analysis for higher-order languages

J. Michael Ashley, R. Kent Dybvig
1998 ACM Transactions on Programming Languages and Systems  
The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator.  ...  The analysis described in this article unifies and extends previous work on flow analyses for higher-order languages supporting assignment and control operators.  ...  In the specification, P(A) denotes the powerset of A. A state in the abstract machine consists of a term, an environment, a store, a cache, and a pending set.  ... 
doi:10.1145/291891.291898 fatcat:y6jsvuapxvgedaub6w3zn7rexa

Automatic Refinement Checking for B [chapter]

Michael Leuschel, Michael Butler
2005 Lecture Notes in Computer Science  
The algorithm checks that a refinement preserves the trace properties of a specification.  ...  It is based on using an operational semantics of B, obtained in practice by the ProB animator.  ...  In future, we plan to extend the refinement checker to also allow on-the-fly expansion of the abstract state space.  ... 
doi:10.1007/11576280_24 fatcat:5ng63cojirf5rmxt27ycivsrcm

Automatically Deriving Control-Flow Graph Generators from Operational Semantics [article]

James Koppel, Jackson Kearl, Armando Solar-Lezama
2020 arXiv   pre-print
Our approach first introduces a new algorithm for converting a large class of small-step operational semantics to an abstract machine.  ...  We show how the choice of two abstraction and projection parameters allow our approach to synthesize several families of CFG-generators useful for different kinds of tools.  ...  We now prove the correspondence between a graph pattern and the relevant subgraph of an abstract transition graph.  ... 
arXiv:2010.04918v1 fatcat:bzxmayfugzdpbo5h3mx5au7jdy
« Previous Showing results 1 — 15 out of 206,932 results