1,710 Hits in 3.3 sec

A Polymorphic Intermediate Verification Language: Design and Logical Encoding [chapter]

K. Rustan M. Leino, Philipp Rümmer
2010 Lecture Notes in Computer Science  
Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood by theorem provers.  ...  The paper gives two encodings of types and formulae in simply typed logic such that SMT solvers and other theorem provers can be used to discharge verification conditions.  ...  We also thank Michał Moskal, Nikolaj Bjørner, and Leonardo de Moura for help with Z3, and them, Alastair Donaldson, Shaz Qadeer, Andrei Voronkov for useful discussions and comments.  ... 
doi:10.1007/978-3-642-12002-2_26 fatcat:5ghnjvv3vze3lmiebfa5pwl4ye

Why Just Boogie? Translating Between Intermediate Verification Languages [article]

Michael Ameri, Carlo A. Furia
2016 arXiv   pre-print
The verification systems Boogie and Why3 use their respective intermediate languages to generate verification conditions from high-level programs.  ...  Since the two systems support different back-end provers (such as Z3 and Alt-Ergo) and are used to encode different high-level languages (such as C# and Java), being able to translate between their intermediate  ...  languages for verification combine programming constructs and a logic language.  ... 
arXiv:1601.00516v2 fatcat:ep5h32oa55bqvik4wdbufhnxui

Scalable Certification for Typed Assembly Language [chapter]

Dan Grossman, Greg Morrisett
2001 Lecture Notes in Computer Science  
To be useful across a range of source languages and compilers, the target-language type system should provide powerful type constructors for encoding higher-level invariants.  ...  In this paper, we describe our experience writing a certifying compiler that targets Typed Assembly Language (TALx86) and discuss some general techniques we have used to keep annotation sizes small and  ...  Acknowledgments The TALx86 infrastructure is a product of the TAL research group. Fred Smith contributed greatly to the prototype Popcorn compiler used for bootstrapping.  ... 
doi:10.1007/3-540-45332-6_5 fatcat:ncxvjh47vfhpninoz6ynma36qy

Scilla: a Smart Contract Intermediate-Level LAnguage [article]

Ilya Sergey, Amrit Kumar, Aquinas Hobor
2018 arXiv   pre-print
This paper outlines key design principles of Scilla---an intermediate-level language for verified smart contracts.  ...  Scilla is not meant to be a high-level programming language, and we are going to use it as a translation target for high-level languages, such as Solidity, for performing program analysis and verification  ...  NRF2014NCR-NCR001-21) and administered by the National Cybersecurity R&D Directorate. Hobor's research was partially supported by a grant from Yale-NUS College R-607-265-322-121.  ... 
arXiv:1801.00687v1 fatcat:gzdquxpo4vd67domwzs47tk2g4

A Golden Age of Hardware Description Languages: Applying Programming Language Techniques to Improve Design Productivity

Lenny Truong, Pat Hanrahan, Michael Wagner
2019 Summit on Advances in Programming Languages  
This vision is based on a meta-programmed host language combined with a core embedded hardware description language that is used as the basis for the research and development of a sea of domain-specific  ...  In this paper, we discuss the intellectual challenges facing researchers interested in hardware description language design, compilers, and formal methods.  ...  Finally, the authors would like to thank the organizers of SNAPL for creating a venue for visionary papers on programming languages.  ... 
doi:10.4230/lipics.snapl.2019.7 dblp:conf/snapl/TruongH19 fatcat:nsehyqgmargfxed2ourqxk3hve

A Short Historical Survey of Functional Hardware Languages

Gang Chen
2012 ISRN Electronics  
This short historical survey is about functional languages specifically created for hardware design and verification.  ...  Functional programming languages offer a high degree of abstractions and clean semantics, which are desirable for hardware descriptions.  ...  Acknowledgment The author grateful to his wife Ping Hu for her support and patience. Thanks are due to Mary Sheeran for his insightful remarks.  ... 
doi:10.5402/2012/271836 fatcat:n2iml6tnnzhzbcjyuslsmdpy64

The Guardol Language and Verification System [chapter]

David Hardin, Konrad Slind, Michael Whalen, Tuan-Hung Pham
2012 Lecture Notes in Computer Science  
Guardol is a domain-specific language designed to facilitate the construction of correct network guards operating over treeshaped data.  ...  Guard programs and specifications are translated to higher order logic, then deductively transformed to a form suitable for a SMT-style decision procedure for recursive functions over tree-structured data  ...  The TACAS reviewers did a well-informed and thorough job, kindly pointing out many mistakes and infelicities in the orginal submission.  ... 
doi:10.1007/978-3-642-28756-5_3 fatcat:2njrcn7ixrdbvnnma23imkcuii

Semantic foundations for typed assembly languages

Amal Ahmed, Andrew W. Appel, Christopher D. Richards, Kedar N. Swadi, Gang Tan, Daniel C. Wang
2010 ACM Transactions on Programming Languages and Systems  
These semantic foundations include Typed Machine Language (TML), a type theory for specifying properties of low-level data with powerful and orthogonal type constructors, and Lc, a compositional logic  ...  We demonstrate this by using TML and Lc to verify the soundness of a low-level, typed assembly language, LTAL, which is the target of our core-ML-to-sparc compiler.  ...  This research was funded in part by DARPA grant F30602-99-1-0519; NSF grants CCR-9974553, CCR-0208601, and CCF-0540914; and ARDA grant NBCHC030106.  ... 
doi:10.1145/1709093.1709094 fatcat:rabhnkyrmjcazman4slpggaavu

Quantum Calculi—From Theory to Language Design

Margherita Zorzi
2019 Applied Sciences  
We explore the twofold perspective (theoretical and concrete) of the approach and we list the main problems one has to face in quantum language design.  ...  We also provide the higher-order encoding in the functional languages qPCFand IQu of the well known Deutsch-Jozsa and Simon's algorithms.  ...  At the same time, formal verification of quantum programs (e.g., based on logic [62, 63] or on mechanizable tools [64] ) became an urgent and exciting challenge.  ... 
doi:10.3390/app9245472 fatcat:ysri3ams6jbsvaxbripdmq7izu

An Isabelle Proof Method Language [chapter]

Daniel Matichuk, Makarius Wenzel, Toby Murray
2014 Lecture Notes in Computer Science  
We describe the language and the design principles on which it was developed.  ...  We evaluate its effectiveness by implementing some tactics widely-used in the seL4 verification stack, and report on its strengths and limitations.  ...  Acknowledgements We would like to thank Gerwin Klein, who was involved in the discussions on the design of Eisbach and who provided early feedback on this paper.  ... 
doi:10.1007/978-3-319-08970-6_25 fatcat:j32ukqtr35di5emlzbcpqlwta4

A Certified Core Policy Language

Bahman Sistany, Amy Felty
2017 2017 15th Annual Conference on Privacy, Security and Trust (PST)  
We present the design and implementation of a Certified Core Policy Language (AC-CPL) that can be used to express access-control rules and policies.  ...  The design of ACCPL is therefore a trade-off between ease of formal proof of correctness and expressive power.  ...  Acknowledgements I would like to thank my thesis advisor, Amy Felty, for her support and encouragement, and her constant feedback and guidance during the course of my PhD studies.  ... 
doi:10.1109/pst.2017.00054 dblp:conf/pst/SistanyF17 fatcat:nldhenqwmfcmtcfvas55vgvqzi

Reflections on the design of a specification language [chapter]

Stefan Kahrs, Donald Sannella
1998 Lecture Notes in Computer Science  
Our aim is to isolate problems and issues that are intrinsic to the general enterprise of designing a specification language for use with a given programming language.  ...  We reflect on our experiences from work on the design and semantic underpinnings of Extended ML, a specification language which supports the specification and formal development of Standard ML programs  ...  Thanks to Michel Bidoit for useful comments on a draft.  ... 
doi:10.1007/bfb0053589 fatcat:23qywct3ljbwrc23j63e2hgjny

Leveraging rust types for modular specification and verification

Vytautas Astrauskas, Peter Müller, Federico Poli, Alexander J. Summers
2019 Proceedings of the ACM on Programming Languages (PACMPL)  
For traditional system programming languages, formal verification is notoriously difficult and requires complex specifications and logics to reason about pointers, aliasing, and side effects on mutable  ...  We analyse information from the Rust compiler and synthesise a corresponding core proof for the program in a flavour of separation logic tailored to automation.  ...  We are also very grateful to Florian Hahn for his work on a precursor to this project [Hahn 2015] , and to Malte Schwerhoff and Nicolas Trüssel for their generous help with our evaluation.  ... 
doi:10.1145/3360573 fatcat:qh4mm7dvnvgehcptkzxpkjbtme

The synchronous languages 12 years later

A. Benveniste, P. Caspi, S.A. Edwards, N. Halbwachs, P. Le Guernic, R. de Simone
2003 Proceedings of the IEEE  
Today, synchronous languages have been established as a technology of choice for modeling, specifying, validating, and implementing real-time embedded applications.  ...  Twelve years ago, PROCEEDINGS OF THE IEEE devoted a special section to the synchronous languages.  ...  For example, the imperative Esterel language was compiled into a logic-netlist-based intermediate representation that enabled existing logic optimization technology to be used to optimize Esterel programs  ... 
doi:10.1109/jproc.2002.805826 fatcat:pdjbogxbovgvnc27ijgbch47aa

Compiler verification meets cross-language linking via data abstraction

Peng Wang, Santiago Cuellar, Adam Chlipala
2014 Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14  
We describe our Coq verification of a compiler for a high-level language, such that the compiler correctness theorem allows us to derive partial-correctness Hoare-logic theorems for programs built by linking  ...  Many real programs are written in multiple different programming languages, and supporting this pattern creates challenges for formal compiler verification.  ...  The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of DARPA  ... 
doi:10.1145/2660193.2660201 dblp:conf/oopsla/WangCC14 fatcat:r4sffqq5k5afllb3a2hbet3v3e
« Previous Showing results 1 — 15 out of 1,710 results