The calculus of constructions

Coquand, Thierry; Huet, Gérard

doi:10.1016/0890-5401(88)90005-3

Cited by 775 publications

(376 citation statements)

References 9 publications

Supporting

Mentioning

375

Contrasting

Unclassified

Order By: Relevance

“…Most of those properties have been discussed in previous work where they have been presented and analyzed using a variety of formal settings and approaches. In this work we provide a complete and uniform formulation of multiple properties using the higher order logic of the Calculus of Inductive Constructions [27,40], and the formal verification is carried out using the Coq proof assistant [19,48]. Furthermore, we present and discuss proofs of properties that have not been previously given a formal treatment.…”

Section: Contributionmentioning

confidence: 99%

Formal Analysis of Android's Permission-Based Security Model

Betarte¹,

Campo²,

Luna³

et al. 2016

SACS

View full text Add to dashboard Cite

In this work we present a comprehensive formal specification of an idealized formulation of Android's permission model. Permissions in Android are basically tags that developers declare in their applications, more precisely in the so-called application manifest, to gain access to sensitive resources. Several analyses have recently been carried out concerning the security of the Android system. Few of them, however, pay attention to the formal aspects of the permission enforcing framework. We provide a complete and uniform formulation of several security properties using the higher order logic of the Calculus of Inductive Constructions and sketch the proofs that have been developed and verified using the Coq proof assistant. We also analyze how the changes introduced in the latest version of Android, that allows to manage permissions at runtime, impact the presented model.

show abstract

Section: Contributionmentioning

confidence: 99%

Formal Analysis of Android's Permission-Based Security Model

Betarte¹,

Campo²,

Luna³

et al. 2016

SACS

View full text Add to dashboard Cite

show abstract

“…For instance, ∀x:τ.p(x) defines a type family p indexed by objects of type τ , that is, p(N ) is a type for any object N of type τ . We refrain from presenting further insights into the technical aspects of dependent type theories for the sake of brevity, simply noting that their expressive power gives rise to practical and useful solutions to problems that range from foundational aspects [13,14,25] to more practical aspects of computer science [28,31]. In our interpretation, we assume that we can define type families in the functional term language, that is, the functional term language is a dependent type theory in the style of [19,28].…”

Section: Quantification and Term Passingmentioning

confidence: 99%

Dependent session types via intuitionistic linear type theory

Toninho

Caires

Pfenning

2011

Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming

View full text Add to dashboard Cite

We develop an interpretation of linear type theory as dependent session types for a term passing extension of the π-calculus. The type system allows us to express rich constraints on sessions, such as interface contracts and proof-carrying certification, which go beyond existing session type systems, and are here justified on purely logical grounds. We can further refine our interpretation using proof irrelevance to eliminate communication overhead for proofs between trusted parties. Our technical results include type preservation and global progress, which in our setting naturally imply compliance to all properties declared in interface contracts expressed by dependent types.

show abstract

“…The Coq proof assistant [5], based on a core calculus known as the Calculus of Inductive Constructions (CIC) [6], is a tool for developing formal mathematical proofs, specifications, and certified programs. Since everything is formalized in Coq using CIC, all logic and proof development is actually implemented as type checking.…”

Section: Formalization In Coqmentioning

confidence: 99%

Towards language-based verification of robot behaviors

Cowley

Taylor

2011

2011 IEEE/RSJ International Conference on Intelligent Robots and Systems

View full text Add to dashboard Cite

Abstract-The management of finite resources is central to many robot behaviors. Some robotic systems must maintain invariants regarding the disposition of feet for balancing, others have grippers for manipulating their environments, while yet others must respect strict rules governing the usage of objects in the environment. Yet the specifics of such resource management responsibilities are almost universally locked behind opaque controllers whose lack of type information greatly impedes rigorous static analysis. We present an application of dependent type theory and linear logic for the static analysis of robot behavior programs that manage both robot and environment state, with a worked assembly task example. This approach offers static, formal guarantees with respect to safety requirements attached to primitive actions, as well as introspection of expected state at each step of a scripted sequence of actions allowing for the automatic generation of dynamic, sensor-based, runtime verification of successful execution.

show abstract

The calculus of constructions

Cited by 775 publications

References 9 publications

Formal Analysis of Android's Permission-Based Security Model

Formal Analysis of Android's Permission-Based Security Model

Dependent session types via intuitionistic linear type theory

Towards language-based verification of robot behaviors

Contact Info

Product

Resources

About