Results 1  10
of
85
Hygienic Macros for ACL2
"... Abstract. ACL2 is a theorem prover for a purely functional subset of Common Lisp. It inherits Common Lisp’s unhygienic macros, which are used pervasively to eliminate repeated syntactic patterns. The lack of hygiene means that macros do not automatically protect their producers or consumers from acc ..."
Abstract
 Add to MetaCart
Abstract. ACL2 is a theorem prover for a purely functional subset of Common Lisp. It inherits Common Lisp’s unhygienic macros, which are used pervasively to eliminate repeated syntactic patterns. The lack of hygiene means that macros do not automatically protect their producers or consumers from
FAQ for proof producing synthesis in HOL
 Sixth International Workshop on Designing Correct Circuits
, 2006
"... Proof producing synthesis compiles a source specification (see 2) to an implementation and generates a theorem certifying that the implementation is correct. The specification is expressed in higher order logic. 2 What is the synthesisable subset of HOL? The compiler automatically translates functio ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Proof producing synthesis compiles a source specification (see 2) to an implementation and generates a theorem certifying that the implementation is correct. The specification is expressed in higher order logic. 2 What is the synthesisable subset of HOL? The compiler automatically translates
Toward an Operational Semantics of PROMELA in ACL2
 In Proceedings of the Third SPIN Workshop, SPIN97
, 1997
"... This report describes an operational semantic definition for most of PROMELA in the logic of ACL2 [KM94]. It should be considered a preliminary version, which can be refined in response to public scrutiny. Natarajan and Holzmann have described an operational semantics for a smaller subset of PROMELA ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
, ACL2 performs some useful error checking on the definition. The number of arguments and results of each function is checked for consistent usage. The termination of each function is proved at the time it is accepted. The primitive ACL2 type of the result of each function is automatically deduced
Toward an Operational Semantics of PROMELAinACL2
"... This report describes an operational semantic definition for most of PROMELA in the logic of ACL2 [KM94]. It should be considered a preliminary version, which can be refined in response to public scrutiny. Natarajan and Holzmann have described an operational semantics for a smaller subset of PROMELA ..."
Abstract
 Add to MetaCart
, ACL2 performs some useful error checking on the definition. The number of arguments and results of eachfunctionischecked for consistent usage. The termination of each function is proved at the time it is accepted. The primitiveACL2 type of the result of each function is automatically deduced
Formal verification of VHDL using VHDLlike ACL2 models
 In Forum on Design Languages (FDL
, 1999
"... : When a design reaches the register transfer level, essential architectural decisions have been taken; their validation required extensive simulation of the abstract behavioral specifications. The recognized need for formal verification cannot be met by current automatic equivalence and model check ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, this model is executable as well as subject to symbolic manipulations. We define the semantics of VHDL data types and behavioralstyle statements in the logic. We use macros to generate names, function definitions and theorems automatically, by instantiation of model skeletons, while retaining an algorithmic
Automatic derivation and application of induction schemes for mutually recursive functions
 In Proc. of CL 2000, volume 1861 of LNAI
, 2000
"... Abstract. This paper advocates and explores the use of multipredicate induction schemes for proofs about mutually recursive functions. The interactive application of multipredicate schemes stemming from datatype definitions is already wellestablished practice; this paper describes an automated pr ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. This paper advocates and explores the use of multipredicate induction schemes for proofs about mutually recursive functions. The interactive application of multipredicate schemes stemming from datatype definitions is already wellestablished practice; this paper describes an automated
Extensible Layout in Functional Documents
 In Digital Publishing, Proc. of SPIEIS&T Electronic Imaging, Vol 6076
, 2006
"... layout, functional programming Highly customised variabledata documents make automatic layout of the resulting publication hard. Architectures for defining and processing such documents can benefit if the repertoire of layout methods available can be extended smoothly and easily to accommodate new ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
layout, functional programming Highly customised variabledata documents make automatic layout of the resulting publication hard. Architectures for defining and processing such documents can benefit if the repertoire of layout methods available can be extended smoothly and easily to accommodate new
Abstract Monadification of Functional Programs
"... The structure of monadic functional programs allows the integration of many different features by just changing the definition of the monad and not the rest of the program, which is a desirable feature from a software engineering and software maintenance point of view. We describe an algorithm for t ..."
Abstract
 Add to MetaCart
The structure of monadic functional programs allows the integration of many different features by just changing the definition of the monad and not the rest of the program, which is a desirable feature from a software engineering and software maintenance point of view. We describe an algorithm
Automatic Enumeration of (Relatedkey) Differential and Linear Characteristics with Predefined Properties and Its Applications
"... Abstract. In this paper, we investigate the Mixedinteger Linear Programming (MILP) modelling of the differential and linear behavior of a wide rang of block ciphers. The differential and linear behavior of the transformations involved in a block cipher can be described by a set P ⊆ {0, 1}n ⊆ Rn. We ..."
Abstract
 Add to MetaCart
on these discoveries and MILP technique, we propose an automatic method for finding high probability (relatedkey) differential or linear characteristics of block ciphers. Compared with Sun et al.’s heuristic method presented in Asiacrypt 2014, the new method is exact for most ciphers in the sense that every feasible
Results 1  10
of
85