Filters








104 Hits in 2.9 sec

A List-Machine Benchmark for Mechanized Metatheory

Andrew W. Appel, Robert Dockins, Xavier Leroy
2011 Journal of automated reasoning  
We propose specific criteria for evaluating the utility of mechanized metatheory systems; we have constructed solutions in both Coq and Twelf metatheory, and we draw conclusions about those two systems  ...  In contrast to the first POPLmark, we emphasize the connection of proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion.  ...  In Twelf, once again, we perform a one-line query in the logic-program interpreter.  ... 
doi:10.1007/s10817-011-9226-1 fatcat:zn4gizq7yrbpdpphxsfz4htm3u

Relational foundations for functorial data migration

David I. Spivak, Ryan Wisnesky
2015 Proceedings of the 15th Symposium on Database Programming Languages - DBPL 2015  
We present an algebraic query language FQL based on these functors, investigate its metatheory, and present SQL query generation algorithms. * Spivak acknowledges support from ONR grants N000141010841  ...  We study the data transformation capabilities associated with schemas that are presented by labeled directed multi-graphs and path equivalence constraints.  ...  The authors would like to thank Lucian Popa for answering our many questions about database theory.  ... 
doi:10.1145/2815072.2815075 dblp:conf/dbpl/SpivakW15 fatcat:tp7sbjr63vajfj7iusirjfoxnm

Why (meta-)theories of automated software design are essential: A personal perspective

Don Batory
2013 2013 2nd SEMAT Workshop on a General Theory of Software Engineering (GTSE)  
The reason is simple economics: generators will remove the burden of difficult or mundane tasks from an engineer to a machine.  ...  Abstracting the core activities of a domain expert and automating them is analogous to creating and evaluating theories in physics and other natural sciences.  ...  Any opinions, findings and conclusions or recommendations expressed in this paper are those of the author and do not necessarily reflect the views of the NSF.  ... 
doi:10.1109/gtse.2013.6613865 dblp:conf/icse/Batory13 fatcat:2p62qnkekfagpmtzebtj7evkyy

Transportable natural-language interfaces

Barbara J. Grosz
1982 Proceedings of the 20th annual meeting on Association for Computational Linguistics -  
(2) The department is big./ How big is the department? (3) The department has many employees./ How many employees does the department have? The ship is heavy./ How heavy is the ship?  ...  Konollge [1981] suggests one possible approach to this in which a metatheory is employed to describe both the domain of discourse and the information the database contains.  ... 
doi:10.3115/981251.981262 dblp:conf/acl/Grosz82 fatcat:lvjadlzmnjgtdgz7h4dkschx5u

Distance makes the types grow stronger

Jason Reed, Benjamin C. Pierce
2010 SIGPLAN notices  
guarantees differential privacy, allowing the programmer to write complex privacy-safe query programs in a flexible and compositional way.  ...  Differential privacy offers a strong statistical guarantee that the effect of the presence of any individual in a database will be negligible, even when an adversary has auxiliary knowledge.  ...  Note that we must impose a global limit on how many queries can be asked of the same database: if we could ask the same query over and over again, we could eventually learn the true value of f with high  ... 
doi:10.1145/1932681.1863568 fatcat:2vkydv6m4ffqtev5t7gdln52qu

Distance makes the types grow stronger

Jason Reed, Benjamin C. Pierce
2010 Proceedings of the 15th ACM SIGPLAN international conference on Functional programming - ICFP '10  
guarantees differential privacy, allowing the programmer to write complex privacy-safe query programs in a flexible and compositional way.  ...  Differential privacy offers a strong statistical guarantee that the effect of the presence of any individual in a database will be negligible, even when an adversary has auxiliary knowledge.  ...  Note that we must impose a global limit on how many queries can be asked of the same database: if we could ask the same query over and over again, we could eventually learn the true value of f with high  ... 
doi:10.1145/1863543.1863568 dblp:conf/icfp/ReedP10 fatcat:6xvioynijreq3o3wr6qlrkprru

Secure distributed programming with value-dependent types

NIKHIL SWAMY, JUAN CHEN, CÉDRIC FOURNET, PIERRE-YVES STRUB, KARTHIKEYAN BHARGAVAN, JEAN YANG
2013 Journal of functional programming  
The compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification.  ...  we have programmed and verified more than 20,000 lines of F including (1) new schemes for multi-party sessions; (2) a zero-knowledge privacy-preserving payment protocol; (3) a provenance-aware curated database  ...  It takes as input an F program and typechecks the program by asking logical queries of Z3. The compiler also accepts Fine and F7 programs and translates them into F .  ... 
doi:10.1017/s0956796813000142 fatcat:xaln3te5lvhbnfgfln5qan4tea

Secure distributed programming with value-dependent types

Nikhil Swamy, Juan Chen, Cédric Fournet, Pierre-Yves Strub, Karthikeyan Bhargavan, Jean Yang
2011 SIGPLAN notices  
The compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification.  ...  we have programmed and verified more than 20,000 lines of F including (1) new schemes for multi-party sessions; (2) a zero-knowledge privacy-preserving payment protocol; (3) a provenance-aware curated database  ...  It takes as input an F program and typechecks the program by asking logical queries of Z3. The compiler also accepts Fine and F7 programs and translates them into F .  ... 
doi:10.1145/2034574.2034811 fatcat:kmtf5wnqo5gjrjlcpjwlgyzb2u

The declarative imperative

Joseph M. Hellerstein
2010 SIGMOD record  
This juxtaposition raises the possibility that the theory of declarative database query languages can provide a foundation for the next generation of parallel and distributed programming languages.  ...  Most importantly, I make a case for database researchers to take a leadership role in addressing the impending programming crisis.  ...  My benchmark of quality for invited papers is Papadimitriou's "Database Metatheory" [60] . Although I looked to it for inspiration, I had no pretensions to its breadth or charm.  ... 
doi:10.1145/1860702.1860704 fatcat:p7w5mmjqqjh5pmu2gbmtm24kau

Secure distributed programming with value-dependent types

Nikhil Swamy, Juan Chen, Cédric Fournet, Pierre-Yves Strub, Karthikeyan Bhargavan, Jean Yang
2011 Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11  
The statement of the soundness result in the main body of the paper is updated (with more details) to match the statement in Appendix A.  ...  It is an extended version of a shorter paper of the same title.  ...  It takes as input an F program and typechecks the program by asking logical queries of Z3. The compiler also accepts Fine and F7 programs and translates them into F .  ... 
doi:10.1145/2034773.2034811 dblp:conf/icfp/SwamyCFSBY11 fatcat:cxfg2l5xpjc2da4a7cc6btvdoi

Making Isabelle Content Accessible in Knowledge Representation Formats [article]

Michael Kohlhase, Florian Rabe, Makarius Wenzel
2020 arXiv   pre-print
In the case of Isabelle, an export of the library into a FAIR (Findable, Accessible, Interoperable, and Reusable) knowledge exchange format was already envisioned by the authors in 1999 but had previously  ...  After substantial improvements of the Isabelle Prover IDE (PIDE) and the OMDoc/Mmt format since then, we are now able to deliver such an export.  ...  The exposed aspects of document meaning are stored within the session database.  ... 
arXiv:2005.08884v1 fatcat:tnzdgnb22zedvod3odyj6avqye

Pilsner: a compositionally verified compiler for a higher-order imperative language

Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Craig McLaughlin, Derek Dreyer, Viktor Vafeiadis
2015 SIGPLAN notices  
The output of Zwickel and the self-modifying T module can then be safely linked together with the output of Pilsner.  ...  Pilsner is the first multi-pass compiler for a higher-order imperative language to be compositionally verified.  ...  We achieve this by having the global worlds involving T maintain as part of their state a database of allocated values. Their query handler for T then checks for a matching entry in this database.  ... 
doi:10.1145/2858949.2784764 fatcat:ys5nzyecxfeprpx546dser4jza

Pilsner: a compositionally verified compiler for a higher-order imperative language

Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Craig McLaughlin, Derek Dreyer, Viktor Vafeiadis
2015 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015  
The output of Zwickel and the self-modifying T module can then be safely linked together with the output of Pilsner.  ...  Pilsner is the first multi-pass compiler for a higher-order imperative language to be compositionally verified.  ...  We achieve this by having the global worlds involving T maintain as part of their state a database of allocated values. Their query handler for T then checks for a matching entry in this database.  ... 
doi:10.1145/2784731.2784764 dblp:conf/icfp/NeisHKMDV15 fatcat:w64tpzoz2jbm5eytj64xjxouoa

PhD Abstracts

GRAHAM HUTTON
2014 Journal of functional programming  
The abstracts are freely available on the JFP website, i.e. not behind any paywall, and do not require any transfer for copyright, merely a license from the author.  ...  As a service to the community, JFP is launching a new feature, in the form of a regular publication of abstracts from PhD dissertations that were completed during the previous year.  ...  LMS has also been used to generate SQL for embedded database queries and JavaScript for web applications.  ... 
doi:10.1017/s0956796814000215 fatcat:rs2j5wgm5ndf7ek2zls5pmg2w4

dkal ⋆ : Constructing Executable Specifications of Authorization Protocols [chapter]

Jean-Baptiste Jeannin, Guido de Caso, Juan Chen, Yuri Gurevich, Prasad Naldurg, Nikhil Swamy
2013 Lecture Notes in Computer Science  
When reasoning about the security of the entire system, one must study not only policies in the authorization logic but also hard-to-analyze implementation code.  ...  Importantly, many low-level details of the protocol (e.g., marshaling formats or management of state consistency) are left abstract in DKAL , but sufficient details must be provided in order for the protocol  ...  SD3 (Jim 2001 ) focus on the problem of deciding authorization by means of solving a query on a distributed database.  ... 
doi:10.1007/978-3-642-36563-8_10 fatcat:hwj3ktnfkbafzasbvdhs7nvuya
« Previous Showing results 1 — 15 out of 104 results