Filters








28,441 Hits in 5.0 sec

A Formal Framework for Program Anomaly Detection [chapter]

Xiaokui Shu, Danfeng Yao, Barbara G. Ryder
2015 Lecture Notes in Computer Science  
We prove the theoretical accuracy limit for program anomaly detection with an abstract detection machine.  ...  We also point out some potential modeling features for future program anomaly detection evolution. should not (e.g., an attack).  ...  The authors would like to thank anonymous reviewers for their comments on stochastic languages.  ... 
doi:10.1007/978-3-319-26362-5_13 fatcat:4qcygxknqjh45meygssx346vnm

PhD Abstracts

GRAHAM HUTTON
2015 Journal of functional programming  
Many students complete PhDs in functional programming each year, but there is currently no common location in which to promote and advertise the resulting work.  ...  As a service to the community, JFP recently launched a new feature, in the form of a regular publication of abstracts from PhD dissertations that were completed during the previous year.  ...  Free theorems in languages with real-world programming features DANIEL SEIDEL Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn, Germany Date: October 2013; Advisor: Janis Voigtländer URL: http://nbn-resolving  ... 
doi:10.1017/s0956796815000040 fatcat:g7yt23qxivevte45fkiqv6xwna

Object-Oriented Theorem Proving (OOTP): First Thoughts [article]

Moez A. AbdelGawad
2019 arXiv   pre-print
., computer-assisted) theorem proving (ATP) can come in many flavors. This document presents early steps in our effort towards defining object-oriented theorem proving (OOTP) as a new style of ATP.  ...  While TTP is strongly based on functional programming (FP), OOTP is strongly based on object-oriented programming (OOP) instead.  ...  of functional programming languages 3 ), we believe OOTP might also prove to be more practically useful in proving theorems about the real-world-intrinsically complex, interconnected and interdependent  ... 
arXiv:1712.09958v2 fatcat:lwro5nrxl5gc7npcxafmizfuxm

Theoretical Aspects of Computing

Gabriel Ciobanu
2014 Scientific Annals of Computer Science  
ICTAC 2014 welcomed submissions from the following areas: automata theory and formal languages; principles and semantics of programming languages; theories of concurrency, mobility and reconfiguration;  ...  verification; software specification, refinement, verification and testing; model checking and theorem proving; models of object and component systems; coordination and feature interaction; integration  ...  verification; software specification, refinement, verification and testing; model checking and theorem proving; models of object and component systems; coordination and feature interaction; integration  ... 
doi:10.7561/sacs.2014.2.173 fatcat:6gqkwapiqzc23aok7m2fmydcjy

PhD Abstracts

GRAHAM HUTTON
2020 Journal of functional programming  
Many students complete PhDs in functional programming each year.  ...  As a service to the community, twice per year the Journal of Functional Programming publishes the abstracts from PhD dissertations completed during the previous year.  ...  To cope with the problems of concurrent programming, language designers have proposed communication-centric programming languages, which eschew shared memory in favour of message passing.  ... 
doi:10.1017/s0956796819000200 fatcat:rsyetan23fgzzhrg7vlk3h2frm

An Intelligent Theory of Cost for Partial Metric Spaces [chapter]

Steve Matthews, Michael Bukatin
2012 Lecture Notes in Computer Science  
As examples we consider the cost of computing a double negation ¬¬p in two-valued propositional logic, the cost of computing negation as failure in logic programming, and a cost model for the hiaton time  ...  This is needed to model computable partial information, but falls short in an important respect.  ...  Discrete mathematics, as understood in Computer Science, has developed firm roots driven by real-world applications.  ... 
doi:10.1007/978-3-642-35506-6_18 fatcat:3lbtmpcxevbvpa7ngs3nc3tw3q

Call by Meaning

Hesam Samimi, Chris Deaton, Yoshiki Ohshima, Alessandro Warth, Todd Millstein
2014 Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software - Onward! '14  
On another front, programming languages rarely provide mechanisms for anchoring objects/data to real-world concepts.  ...  In the vision, a rich specification language and common sense knowledge base over real-world concepts serves as a lingua franca to describe software components.  ...  Acknowledgments We thank Alan Kay for the encouragement to explore Cyc towards programming.  ... 
doi:10.1145/2661136.2661152 dblp:conf/oopsla/SamimiDOWM14 fatcat:uj7qmal5mzgkhhcxmcinna2jnm

Is there a mismatch between real-world feature models and product-line research?

Alexander Knüppel, Thomas Thüm, Stephan Mennicke, Jens Meinicke, Ina Schaefer
2017 Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering - ESEC/FSE 2017  
Our evaluation on large feature models, including the Linux kernel, gives evidence that require and exclude constraints are not sufficient to express real-world feature models.  ...  We developed an algorithm to eliminate complex cross-tree constraints in a feature model, enabling the combination of tools and algorithms working with different feature model dialects in a plug-and-play  ...  We thank Thorsten Berger for his support in retrieving feature diagrams for real-world feature models. Thanks to Niklas Lehnfeld for his help with developing the software artifacts.  ... 
doi:10.1145/3106237.3106252 dblp:conf/sigsoft/KnuppelTMMS17 fatcat:4ien4kr7lzhmhm3ci2udjrjyau

Dependent Types, Theorem Proving, and Applications for a Verifying Compiler [chapter]

Yves Bertot, Laurent Théry
2008 Lecture Notes in Computer Science  
In a functional language programming with dependent types, this capability becomes naturally practical for functional programming languages.  ...  The most common kind of restriction is to consider a strongly typed side-effect free functional language, with restricted forms of recursion to ensure that all computations terminate (often boiling down  ...  This feature adds expressive power to the programming language being studied inside the theorem prover.  ... 
doi:10.1007/978-3-540-69149-5_19 fatcat:saqebbd3anay7m3zattxr2s7bi

Page 3500 of Mathematical Reviews Vol. , Issue 84i [page]

1984 Mathematical Reviews  
Then a theorem that each strong terminating program is equivalent to a loop-free program is proved.” Klein, Peter D.(1-RTG2) Real knowledge. Synthese 55 (1983), no. 2, 143-164.  ...  Two consequences of that requirement are discussed: (1) If S really knows that p, then S knows simpliciter that S knows simpliciter that p, and (2) the iterative feature of real knowledge mentioned in  ... 

A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased automation, consistency, and reusability [article]

Zheng Yang, Hang Lei
2018 arXiv   pre-print
We also implement a toy functional programming language in a generalized algebraic datatypes style and a formal interpreter in Coq based on the GERM framework.  ...  in higher-order logic theorem proving assistant tools.  ...  The formal syntax and semantics of IPL should be equivalent with the respective real world target programming languages'. The IPL is for the reusability and consistency problems.  ... 
arXiv:1803.00403v3 fatcat:jpgpzx5zxnbpbpzfdj7kowgee4

Languages, Ambiguity, and Verification [chapter]

The SPARK Team
2008 Lecture Notes in Computer Science  
We argue that the provision of an unambiguous semantics for a programming language is crucial if the verification framework is to be sound, deep and efficient.  ...  This position paper is based on presentations given at the Grand Challenge workshops held at Gresham College in March 2004 and in Newcastle in July 2005.  ...  SPARK in the real world We now have a small, but non-trivial set of customers using the SPARK system to prove real properties of real programs.  ... 
doi:10.1007/978-3-540-69149-5_52 fatcat:ahdymw2m45afvkvzgxsyrtnx5i

A Survey on Theorem Provers in Formal Methods [article]

M. Saqib Nawaz, Moin Malik, Yi Li, Meng Sun, M. Ikram Ullah Lali
2019 arXiv   pre-print
language, differences and application areas.  ...  In literature, there is a shortage of comprehensive documents that can provide proper guidance about the preferences of theorem provers with respect to their designs, performances, logical frameworks,  ...  Areas In various data structure real world embedding Derive new theorem for automated reasoning Testing algebraic data type and functional logic program Teaching geometry, algebra and physics in China  ... 
arXiv:1912.03028v1 fatcat:fabxqg75xjhxlh7u3uyypgyzdy

Page 6325 of Mathematical Reviews Vol. , Issue 93k [page]

1993 Mathematical Reviews  
In real world applications of theorem proving, this is almost certain to be infeasible.  ...  We take the substitution rule as an additional operator, mgi, of the algebra of the language terms and provide them with a variable-free abstract representation, c-expressions.  ... 

The foundations of computation, physics and mentality: the Turing legacy

S. B. Cooper, S. Abramsky
2012 Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences  
-The article by Barmpalias & Dowe [12] arises from Wallace's work on information theory, with regard to his interest in the notion of a real preserving universality with respect to a prefix-free machine  ...  Again, there are connections with Bell's theorem in the foundations of quantum mechanics.  ... 
doi:10.1098/rsta.2012.0221 pmid:22711858 pmcid:PMC3385671 fatcat:urgzy6r4rja4tawejrymyfsuee
« Previous Showing results 1 — 15 out of 28,441 results