Filters








4,393 Hits in 3.2 sec

Formally proving a compiler transformation safe

Joachim Breitner
2015 Proceedings of the 8th ACM SIGPLAN Symposium on Haskell - Haskell 2015  
We prove that the Call Arity analysis and transformation, as implemented in the Haskell compiler GHC, is safe, i.e. does not impede the performance of the program.  ...  optimization safety theorems.  ...  Related Work This work connects arity and cardinality analyses with operational safety properties, using an interactive theorem prover; as such this is a first.  ... 
doi:10.1145/2804302.2804312 dblp:conf/haskell/Breitner15 fatcat:eygt34wejfbdteqvgw5ecuc4ju

A Purely Functional Computer Algebra System Embedded in Haskell [chapter]

Hiromi Ishii
2018 Lecture Notes in Computer Science  
Utilising methods in functional programming and prominent features of Haskell, this library achieves safety, composability, and correctness at the same time.  ...  As a proof-of-concept, we present the computational-algebra package.  ...  This is a pre-print of an article published in "Computer Algebra in Scientific Computing" (2018). The final authenticated version is available online at: https://doi.org/10.1007/978-3-319-99639-4  ... 
doi:10.1007/978-3-319-99639-4_20 fatcat:fd4hirkmvvb4ze6wlogxlozww4

scat: Learning from a single execution of a binary

Franck de Goer, Christopher Ferreira, Laurent Mounier
2017 2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER)  
We explain the functioning principle of this toolbox, and we give some results obtained on real examples to show its effectiveness.  ...  of the call or return.  ...  We execute the program under the analysis called arity: | scat> launch arity mupdf-x11 poc.pdf This command runs the program mupdf-x11 under analysis, and logs the results of the inference in a file.  ... 
doi:10.1109/saner.2017.7884660 dblp:conf/wcre/GoerFM17 fatcat:qis2cjqo25bnlbkfchywspzgb4

Parametric external predicates for the DLV System [article]

G. Ianni, F. Calimeri, A. Pietramala, M.C. Santoro
2004 arXiv   pre-print
This document describes syntax, semantics and implementation guidelines in order to enrich the DLV system with the possibility to make external C function calls.  ...  This feature is realized by the introduction of parametric external predicates, whose extension is not specified through a logic program but implicitly computed through external code.  ...  In case X appears within the head of the rule, then X must be usually safe. From now on we will use the notion of weak safety as default safety constraint.  ... 
arXiv:cs/0404011v1 fatcat:ifq4hon3kjdidaeufugmzdfiqe

On First-order Cons-free Term Rewriting and PTIME [article]

Cynthia Kop
2017 arXiv   pre-print
In this paper, we prove that (first-order) cons-free term rewriting with a call-by-value reduction strategy exactly characterises the class of PTIME-computable functions.  ...  We use this to give an alternative proof of the result by Carvalho and Simonsen which states that cons-free term rewriting with linearity constraints characterises this class.  ...  We will see that cons-free reduction, when starting with a term of the right shape, preserves B-safety, which limits the constructors that may occur at any position in a term: Definition 3 (B-safety).  ... 
arXiv:1711.03399v2 fatcat:n3wwedfzsbc7jefegcanzewani

Unsafe Order-2 Tree Languages Are Context-Sensitive [chapter]

Naoki Kobayashi, Kazuhiro Inaba, Takeshi Tsukada
2014 Lecture Notes in Computer Science  
A lot of theoretical questions remain open, however, for unsafe higherorder grammars (grammars without the so-called safety condition).  ...  Higher-order grammars have been extensively studied in 1980's and interests in them have revived recently in the context of higher-order model checking and program verification, where higherorder grammars  ...  This work was partially supported by JSPS KAKENHI 23220001 and the Mitsubishi Foundation.  ... 
doi:10.1007/978-3-642-54830-7_10 fatcat:vcf7ueu5wzbqvjucwk3mci6ufe

First-order finite satisfiability vs tree automata in safety verification [article]

Alexei Lisitsa
2011 arXiv   pre-print
In this paper we deal with verification of safety properties of term-rewriting systems.  ...  A finite countermodel produced during successful verification provides with a concise description of the system invariant sufficient to demonstrate a specific safety property.  ...  Each symbol in Σ has an associated arity, and we have F = ∪ i≥0 F i and P = ∪ i≥1 P i , where F i and P i consist of symbols of arity i. The elements of F 0 are also called constants.  ... 
arXiv:1107.0349v1 fatcat:ptuwdaprhnhbrhpy75m7a6vami

Page 123 of The United States Democratic Review Vol. 35, Issue [page]

1855 The United States Democratic Review  
The accident which calls upon the pumps for help, does not call until it has first disa- led them.  ...  But the same shock which broke her paddle-wheels, likewise dislocated and disabled the machinery ; and as the means of motion and of safetythe paddles and the pump—are made dependent on the same identical  ... 

Arity-generic datatype-generic programming

Stephanie Weirich, Chris Casinghino
2010 SIGPLAN notices  
These two axes are not orthogonal because the idea of arity appears in Generic Haskell: datatypegeneric versions of repeat, map and zipWith have different arities of kind-indexed types.  ...  However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments.  ...  Acknowledgments Thanks to Andres Löh and Tim Sheard for discussion, and to the anonymous reviewers for many helpful comments. This paper was generated from literate Agda sources using lhs2TeX.  ... 
doi:10.1145/1816027.1816036 fatcat:ny6uq3xq4bf5hlxfpxd3yoi5oy

Arity-generic datatype-generic programming

Stephanie Weirich, Chris Casinghino
2010 Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification - PLPV '10  
These two axes are not orthogonal because the idea of arity appears in Generic Haskell: datatype-generic versions of repeat, map and zipWith have different arities of kind-indexed types.  ...  However, map is also arity-generic because it belongs to a family of related operations that differ in the number of arguments.  ...  Acknowledgments Thanks to Andres Löh and Tim Sheard for discussion, and to the anonymous reviewers for many helpful comments. This paper was generated from literate Agda sources using lhs2TeX.  ... 
doi:10.1145/1707790.1707799 dblp:conf/plpv/WeirichC10 fatcat:7u4lkuxkd5g6lpd6p427ro7k5e

Typed query languages for databases containing queries

Frank Neven, Dirk Van Gucht, Jan Van den Bussche, Gottfried Vossen
1998 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98  
calculus; and global expressive power and non-redundancy of the proposed formalism.  ...  This paper introduces and studies the relational meta a@ebm, a statically typed extension of the relational algebra to allow for meta programming in databases.  ...  Here, each  j is an expression variable of arity -l?j. We call LY and p patterns with respect to r.  ... 
doi:10.1145/275487.275509 dblp:conf/pods/NevenBGV98 fatcat:elj644hd35edliq2vdie3wtpk4

Typed query languages for databases containing queries

Frank Neven, Jan Van den Bussche, Dirk Van Gucht, Gottfried Vossen
1999 Information Systems  
calculus; and global expressive power and non-redundancy of the proposed formalism.  ...  This paper introduces and studies the relational meta a@ebm, a statically typed extension of the relational algebra to allow for meta programming in databases.  ...  Here, each  j is an expression variable of arity -l?j. We call LY and p patterns with respect to r.  ... 
doi:10.1016/s0306-4379(99)00033-2 fatcat:qw4zyib5cbehdkkls2i25zbgl4

DOMAIN-SPECIFIC TRANSITION SYSTEMS AND THEIR APPLICATION TO A FORMAL DEFINITION OF A MODEL PROGRAMMING LANGUAGE

Igor Anureev
2014 Bulletin of the Novosibirsk Computing Center Series Computer Science  
A formal definition of a model programming language is given on the basis of this model.  ...  The paper presents a new object model of domain-specific transition systems, a formalism designed for the specification and validation of formal methods for assuring software reliability.  ...  The element El is called a safety condition.  ... 
doi:10.31144/bncc.cs.2542-1972.2014.n37.p23-39 fatcat:clg3iaj265eu3moiysbxhblecy

Lock-Free Parallel Garbage Collection [chapter]

H. Gao, J. F. Groote, W. H. Hesselink
2005 Lecture Notes in Computer Science  
We first design and prove an algorithm with a coarse grain of atomicity and subsequently apply the reduction theorem developed in [11] to implement the higher-level atomic steps by means of the low-level  ...  Mutators and collectors can simultaneously operate on the data structure.  ...  The number of children of a node x is indicated by its arity, which is denoted by arity[x]. We let C be the upper bound of the arities of the nodes.  ... 
doi:10.1007/11576235_31 fatcat:ptizfikfkfhrbkajlzx5aj4qcq

Extending Dylan's type system for better type inference and error detection

Hannes Mehnert
2010 Proceedings of the 2010 international conference on Lisp - ILC '10  
As case study we use the Dylan standard library (roughly 32000 lines of code), which witnesses that the implementation generates faster code with fewer errors.  ...  Gradual typing [26] provides the best of both worlds. This paper shows how to define and implement gradual typing in Dylan, traditionally a dynamically typed language.  ...  Also thanks to Peter Sestoft, the author's PhD supervisor at IT University of Copenhagen, for valuable feedback on this paper. And thanks to Peter Housel for his feedback and wording improvements.  ... 
doi:10.1145/1869643.1869645 dblp:conf/lfp/Mehnert10 fatcat:4z4umzuzhzepbkvdubyxzfp7km
« Previous Showing results 1 — 15 out of 4,393 results