Filters








21,096 Hits in 10.1 sec

Extracting a formally verified, fully executable compiler from a proof assistant

Stefan Berghofer, Martin Strecker
2004 Electronical Notes in Theoretical Computer Science  
and compilation) are defined and proved correct.  ...  non-executable constructs.  ...  We are grateful to Tobias Nipkow, Norbert Schirmer and Martin Wildmoser for discussions about this work.  ... 
doi:10.1016/s1571-0661(05)82598-8 fatcat:5ygmeajkizdgnct7n4lvpvhvry

Effective performance measurement and analysis of multithreaded applications

Nathan R. Tallent, John M. Mellor-Crummey
2008 Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '09  
This technique applies broadly to programming models ranging from explicit threading (e.g., Pthreads) to higher-level models such as Cilk and OpenMP.  ...  We describe our approach, implementation, and experiences applying this approach to measure and attribute work, idleness, and overhead in executions of Cilk programs.  ...  The Cilk compiler compiles Cilk source code to C and then uses a vendor C compiler to generate an executable.  ... 
doi:10.1145/1504176.1504210 dblp:conf/ppopp/TallentM09 fatcat:5rzve6xgrnfqdbslpbj7ialaje

Effective performance measurement and analysis of multithreaded applications

Nathan R. Tallent, John M. Mellor-Crummey
2009 SIGPLAN notices  
This technique applies broadly to programming models ranging from explicit threading (e.g., Pthreads) to higher-level models such as Cilk and OpenMP.  ...  We describe our approach, implementation, and experiences applying this approach to measure and attribute work, idleness, and overhead in executions of Cilk programs.  ...  The Cilk compiler compiles Cilk source code to C and then uses a vendor C compiler to generate an executable.  ... 
doi:10.1145/1594835.1504210 fatcat:wemo3tqsmfajzmzadqp7kl3iyy

Comparative Studies of Programming Languages; Course Lecture Notes [article]

Joey Paquet, Serguei A. Mokhov
2010 arXiv   pre-print
These notes include a compiled book of primarily related articles from the Wikipedia, the Free Encyclopedia, as well as Comparative Programming Languages book and other resources, including our own.  ...  Lecture notes for the Comparative Studies of Programming Languages course, COMP6411, taught at the Department of Computer Science and Software Engineering, Faculty of Engineering and Computer Science,  ...  [3] In 1983, the name of the language was changed from C with Classes to C++ (++ being the increment operator in C and C++).  ... 
arXiv:1007.2123v6 fatcat:4vwgbvr4xbhzjoubgv7d52mrke

vlang: Mapping Verilog Netlists to Modern Technologies [article]

Nicholas V. Giamblanco, Andrew Schmidt
2021 arXiv   pre-print
The vlang-produced software executable can be used with other software programs, or to verify the functionality and correctness of the remapped design.  ...  Hardware designers can use HDLs to migrate hardware designs between devices and explore performance, area and power tradeoffs, as well as, port designs to an alternative device.  ...  compiled to the Intel device.  ... 
arXiv:2111.04913v2 fatcat:6jndrg6mufcd7dngi2leidrzby

Falling Back on Executable Specifications [chapter]

Hesam Samimi, Ei Darli Aung, Todd Millstein
2010 Lecture Notes in Computer Science  
However, instead of halting the program upon a contract violation, we employ a constraint solver to automatically execute the specification in order to allow the program to continue properly.  ...  We also describe our experience using the language to enhance the reliability and functionality of several existing Java applications.  ...  Acknowledgments Thanks to Ted Kaehler for discussions about this work and to Dan Marino, Alex Warth, and the anonymous reviewers for valuable feedback on this paper.  ... 
doi:10.1007/978-3-642-14107-2_26 fatcat:e5okge5gsbaj5diqpkqwesoirm

Optimizing Java bytecodes

Michał Cierniak, Wei Li
1997 Concurrency Practice and Experience  
We have designed such a representation, JavaIR, and have written a front-end which recovers high-level structure from the information from the class file.  ...  We have developed a research compiler for Java class files. The compiler, which we call Briki, is designed to test new compilation techniques.  ...  Acknowledgements This work was supported in part by an NSF Research Initiation Award (CCR-9409120) and ARPA contract F19628-94-C-0057.  ... 
doi:10.1002/(sici)1096-9128(199706)9:6<427::aid-cpe300>3.0.co;2-k fatcat:hexxmdwfjff3fixwdvx3rym7rq

Proof-Directed De-compilation of Low-Level Code [chapter]

Shin-ya Katsumata, Atsushi Ohori
2001 Lecture Notes in Computer Science  
This allows us to regard an executable code as a proof in intuitionistic propositional logic.  ...  We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus.  ...  We thank some of anonymous referees for thorough and careful reading of the paper and for providing many helpful comments, which have been very useful for improving the presentation of the paper.  ... 
doi:10.1007/3-540-45309-1_23 fatcat:4krlws2o4ngpna2tqi2x55522y

Using Inferno™ to execute Java™ on small devices [chapter]

C. F. Yurkoski, L. R. Rau, B. K. Ellis
1998 Lecture Notes in Computer Science  
Among the costs of using Java is that the memory and permanent storage required to run applications tends to be large, resulting in them not fitting on devices with limited capacity.  ...  Inferno is a network operating system that was created to allow applications to be easily and dynamically distributed across networks.  ...  To facilitate faster loading, system core classes can be pre-translated from Java byte codes into Dis instructions. • Most Java implementations rely on a large body of native methods written in C/C++.  ... 
doi:10.1007/bfb0057784 fatcat:vyfz77whznbm5f6ubr4trdm2qi

Constraints as control

Ali Sinan Köksal, Viktor Kuncak, Philippe Suter
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications.  ...  Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints  ...  We thank Nikolaj Bjørner and Leonardo de Moura for their help in using Z3, and Adriaan Moors for his help with the Scala compiler.  ... 
doi:10.1145/2103656.2103675 dblp:conf/popl/KoksalKS12 fatcat:cckhatpxnnhmpghi6p7lxjowgy

Constraints as control

Ali Sinan Köksal, Viktor Kuncak, Philippe Suter
2012 SIGPLAN notices  
We evaluate Kaplan on examples ranging from enumeration of data structures to execution of declarative specifications.  ...  Kaplan integrates constraint and imperative programming by using constraints as an advanced control structure; the developers use the monadic 'for' construct to iterate over the solutions of constraints  ...  We thank Nikolaj Bjørner and Leonardo de Moura for their help in using Z3, and Adriaan Moors for his help with the Scala compiler.  ... 
doi:10.1145/2103621.2103675 fatcat:ktkco3x6mjgzbbyrjpxcjwsf5q

Developing Correctly Replicated Databases Using Formal Tools

Nicolas Schiper, Vincent Rahli, Robbert Van Renesse, Marck Bickford, Robert L. Constable
2014 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks  
We compile EventML specifications into a form that can be formally verified while simultaneously obtaining code that can be executed.  ...  We report on our experience using a total order broadcast protocol based on Paxos and specified using a new formal language called EventML.  ...  We have learned from our experiences that it is best to adapt logical methods to follow the way system designers build and reason about systems.  ... 
doi:10.1109/dsn.2014.45 dblp:conf/dsn/SchiperRRBC14 fatcat:oraoyadqurfpbjqwuyvcps67wq

Decompilation of Java bytecode to Prolog by partial evaluation

Miguel Gómez-Zamalloa, Elvira Albert, Germán Puebla
2009 Information and Software Technology  
Decompilation times and decompiled program sizes are linear with the size of the input bytecode program.  ...  Reasoning about Java bytecode (JBC) is complicated due to its unstructured control-flow, the use of three-address code combined with the use of an operand stack, etc.  ...  Acknowledgments We gratefully acknowledge the anonymous referees for many useful comments and suggestions.  ... 
doi:10.1016/j.infsof.2009.04.010 fatcat:febdvtabvjcyrjcjkfgy4qnmy4

Uniqueness and reference immutability for safe parallelism

Colin S. Gordon, Matthew J. Parkinson, Jared Parsons, Aleks Bromfield, Joe Duffy
2012 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12  
We prove the soundness of the type system by an embedding into a program logic.  ...  Our type system models a prototype extension to C# that is in active use by a Microsoft team. We describe their experiences building large systems with this extension.  ...  Acknowledgments Thanks to Dan Grossman, Brian Burg, and the anonymous reviewers for helpful comments, and to Michael Ernst for helpful conversations about related work.  ... 
doi:10.1145/2384616.2384619 dblp:conf/oopsla/GordonPPBD12 fatcat:2n3rtg2trrcalessoccvspj7di

Uniqueness and reference immutability for safe parallelism

Colin S. Gordon, Matthew J. Parkinson, Jared Parsons, Aleks Bromfield, Joe Duffy
2012 SIGPLAN notices  
We prove the soundness of the type system by an embedding into a program logic.  ...  Our type system models a prototype extension to C# that is in active use by a Microsoft team. We describe their experiences building large systems with this extension.  ...  Acknowledgments Thanks to Dan Grossman, Brian Burg, and the anonymous reviewers for helpful comments, and to Michael Ernst for helpful conversations about related work.  ... 
doi:10.1145/2398857.2384619 fatcat:4k5vjnvjnrddhpj6hk4ybho5cy
« Previous Showing results 1 — 15 out of 21,096 results