Filters








27,518 Hits in 4.5 sec

Soundness of data refinement for a higher-order imperative language

David A. Naumann
2002 Theoretical Computer Science  
Using a set-theoretic model of predicate transformers and ordered data types, we give a semantics for an Oberon-like higher-order imperative language with record subtyping and procedure-type variables  ...  Data reÿnement is shown to be sound for this language: It implies algorithmic reÿnement when suitably localized.  ...  Acknowledgements I had helpful discussions of data reÿnement with a number of people including Paul Gardiner, Tony Hoare, Carroll Morgan, and Je Sanders.  ... 
doi:10.1016/s0304-3975(00)00339-x fatcat:mczrnmxdmreljkvxmhrf3p5fjq

Modular reasoning about concurrent higher-order imperative programs

Lars Birkedal
2014 Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '14  
Introduction Modern mainstream programming languages permit a powerful combination of language features: concurrency, higher-order functions, and mutable shared data structures.  ...  For modularity, we use higher-order quantification over so-called impredicative protocols. To show soundness of the logic we build a non-trivial model using guarded recursion.  ... 
doi:10.1145/2535838.2537849 dblp:conf/popl/Birkedal14 fatcat:hjgtj3khsfg2zk766px2gexvaq

Data refinement, call by value and higher order programs

David A. Naumann
1995 Formal Aspects of Computing  
Using 2-categorical laws of algorithmic refinement, we show soundness of data refinement for stored programs and hence for higher order procedures with value/result parameters.  ...  The refinement laws hold in a model that slightly generalizes the standard predicate transformer semantics for the usual imperative programming constructs including prescriptions.  ...  Acknowledgements Thanks to Bob Tennant for inspiring me to write this paper, to the referees for suggestions that improved the presentation, and to Carroll Morgan for encouraging me to use Prog rather  ... 
doi:10.1007/bf01210999 fatcat:75l54bi2wnckpi4ads42pwsn4y

HMC: Verifying Functional Programs Using Abstract Interpreters [chapter]

Ranjit Jhala, Rupak Majumdar, Andrey Rybalchenko
2011 Lecture Notes in Computer Science  
Kobayashi [19, 20] gives an algorithm for model checking arbitrary µ-calculus properties of finite-data programs with higher order functions by a reduction to model checking for higher-order recursion  ...  We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional  ...  The target imperative language for HMC is µC, a first-order imperative language with a single kind of variables of base type β.  ... 
doi:10.1007/978-3-642-22110-1_38 fatcat:gov745hbgfbyzhmto2oe5ol4sm

Page 2044 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
.” 2003c:68027 68N15 68Q55 Naumann, David A. (1-STIT-CS; Hoboken, NJ) Soundness of data refinement for a higher-order imperative language.  ...  Summary: “Using a set-theoretic model of predicate transformers and ordered data types, we give a semantics for an Oberon- like higher-order imperative language with record subtyping and procedure-type  ... 

Page 7820 of Mathematical Reviews Vol. , Issue 97M [page]

1997 Mathematical Reviews  
in higher- order logic.  ...  Gardiner and Carroll Morgan, A single complete rule for data refinement [Tech. Rep.  ... 

HMC: Verifying Functional Programs Using Abstract Interpreters [article]

Ranjit Jhala and Rupak Majumdar and Andrey Rybalchenko
2010 arXiv   pre-print
We present Hindley-Milner-Cousots (HMC), an algorithm that allows any interprocedural analysis for first-order imperative programs to be used to verify safety properties of typed higher-order functional  ...  Next, it transforms the logical refinement constraints into a simple first-order imperative program that is safe iff the constraints are satisfiable.  ...  In contrast, our work shows how higher-order languages can be analyzed directly via abstract analyses designed for first-order imperative languages.  ... 
arXiv:1004.2884v2 fatcat:6wuicdztc5b5tkh5z6ti6aeqzi

Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131)

Marco Gaboardi, Suresh Jagannathan, Ranjit Jhala, Stephanie Weirich, Marc Herbstritt
2016 Dagstuhl Reports  
crucial correctness properties, and the dramatic increase in adoption of higher-order functional languages due to the web, multicore and "big data" revolutions.  ...  While the research community has studied the problem of language based verification for imperative and first-order programs for decades -yielding important ideas like Floyd-Hoare Logics, Abstract Interpretation  ...  Our approach is sound and relatively complete with respect to a first-order solver for base type values.  ... 
doi:10.4230/dagrep.6.3.59 dblp:journals/dagstuhl-reports/GaboardiJJW16 fatcat:zeqdceqvzrgplfdpsbt6deoi2i

Towards Squiggly Refinement Algebra [chapter]

D. A. Naumann
1998 Programming Concepts and Methods PROCOMET '98  
We also give a data refinement from exponents of specifications to the concrete exponents needed for program semantics.  ...  To show its promise, we prove results on exponents and recursion on inductive data types, sufficient for carrying out a polytypic derivation that has been given as a substantial example for functions and  ...  But we want an imperative interpretation of repmin as a higher-order program.  ... 
doi:10.1007/978-0-387-35358-6_23 fatcat:7kmwcy7d5vh3zopkpmpuvxc3nm

Modular Verification for Computer Security

Andrew W. Appel
2016 2016 IEEE 29th Computer Security Foundations Symposium (CSF)  
This can be done by an analysis of the software itself, or by isolating the software behind a protection mechanism such as an operating system kernel (virtual-memory protection) or cryptographic authentication  ...  Here I explain some of the modularity principles that make these verifications possible.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
doi:10.1109/csf.2016.8 dblp:conf/csfw/Appel16 fatcat:7667qxql2ne5dapggwi76wrryq

Relatively complete counterexamples for higher-order programs

Phúc C. Nguyễn, David Van Horn
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
We achieve this result by employing a novel form of symbolic execution for higher-order programs.  ...  In practice, this means an SMT solver can be used for the effective, automated generation of higher-order counterexamples for a large class of programs.  ...  Acknowledgments We thank Sam Tobin-Hochstadt for countless discussions that contributed significantly to the development of this work.  ... 
doi:10.1145/2737924.2737971 dblp:conf/pldi/NguyenH15 fatcat:fgomesiyovfk5io53gm3ycq6be

Relatively Complete Counterexamples for Higher-Order Programs [article]

Phuc C. Nguyen, David Van Horn
2015 arXiv   pre-print
We achieve this result by employing a novel form of symbolic execution for higher-order programs.  ...  In practice, this means an SMT solver can be used for the effective, automated generation of higher-order counterexamples for a large class of programs.  ...  Acknowledgments We thank Sam Tobin-Hochstadt for countless discussions that contributed significantly to the development of this work.  ... 
arXiv:1411.3967v2 fatcat:zprjhaw5ovgohpglks4av7m3he

A Brief Survey of Quantum Programming Languages [chapter]

Peter Selinger
2004 Lecture Notes in Computer Science  
This article is a brief and subjective survey of quantum programming language research.  ...  One such challenge is to give a sound denotational semantics for a higher-order quantum programming language, including classical features and measurement.  ...  Girard [8] recently defined a notion of quantum coherent spaces as a possible semantics for higher-order quantum computation.  ... 
doi:10.1007/978-3-540-24754-8_1 fatcat:27yiduvvkbeupkhxapnmm4ocem

Author index volume 278 (2002)

2002 Theoretical Computer Science  
., Lifting results for categories of algebras (1-2) 257-269 Naumann, D.A., Soundness of data refinement for a higher-order imperative language (1-2) 271-301 Power, J. and G.  ...  , A. and P. Malacaria, Relative definability of boolean functions via hypergraphs (1-2) 91-110 Fiech, A. and D.A.  ... 
doi:10.1016/s0304-3975(02)00149-4 fatcat:aatd2uip3nfazmcqnx5bzq6obq

Automated techniques for higher-order program verification

Naoki KOBAYASHI, Luke ONG, David Van HORN
2013 Progress in Informatics  
Studies of game semantics have yielded compositional model checkers and automated program equivalence checkers for Algol-like programming languages, and studies of higher-order recursion schemes and pushdown  ...  The workshop also aimed for cross-fertilization of different techniques for higher-order program verification, such as game semantics, type theories, higher-order grammars and pushdown systems, control  ...  This may sound like a crazy idea, as higher-order model checking is k-EXPTIME complete in general, for order-k recursion schemes.  ... 
doi:10.2201/niipi.2013.10.9 fatcat:xqfyvx6m25d4jcodwl373vlxlq
« Previous Showing results 1 — 15 out of 27,518 results