Inferable object-oriented typed assembly language

Tate, Ross; Chen, Juan; Hawblitzel, Chris

doi:10.1145/1806596.1806644

Cited by 10 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They require a special compiler to generate machine-code annotated with types [13], while we verify unmodified executables compiled using an offthe-shelf compiler. iTalX [22] infers types for x86 assembly programs, reducing the amount of type annotations required from a modified compiler. Executables have also been verified without using a program logic, although concise theorems cannot be proven.…”

Section: Related Workmentioning

confidence: 99%

AUSPICE: Automatic Safety Property Verification for Unmodified Executables

Tan

Tay

Gandhi

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Verification of machine-code programs using program logic has focused on functional correctness, and proofs have required manuallyprovided program specifications. Fortunately, the verification of shallow safety properties such as memory isolation and control-flow safety can be easier to automate, but past techniques for automatically verifying machine-code safety have required post-compilation transformations, which can change program behavior. In this work, we automatically verify safety properties for unmodified machine-code programs without requiring user-supplied specifications. Our novel logic framework, AUS-PICE, for automatic safety property verification for unmodified executables, extends an existing trustworthy Hoare logic for local reasoning, and provides a novel proof tactic for selective composition. We demonstrate our automated proof technique on synthetic and realistic programs. Our verification completes in 6 hours for a realistic 533-instruction string search algorithm, demonstrating the feasibility of our approach.

show abstract

Section: Related Workmentioning

confidence: 99%

AUSPICE: Automatic Safety Property Verification for Unmodified Executables

Tan

Tay

Gandhi

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The result was led to more strength in the program execution and more reliability in the language level. This work keeps moving effectively toward iTALx and its related family .…”

Section: Preliminaries and Backgroundmentioning

confidence: 99%

Privacy enhancement in anonymous network channels using multimodality injection

Nia

Atani

Ruiz‐Martínez³

2015

Security Comm Networks

View full text Add to dashboard Cite

The increase of the capacity of processing units and the growth of distributed computing make easy to collect and process information of Internet traffic flows. This information, however, can be used to perform attacks in anonymous communications that could compromise privacy. With the aim of preventing these attacks, we propose a scheme that implements a multimodal behavior using the random walk theory and crypto-types. The random walk mechanism is responsible for generating network patterns, and the cryptotype performs the micro-encryption tasks using series of quantum-resistant cryptography methods through the anonymous channel. The result shows that using this technique, we can prevent network analysis attacks by means of the generation of a different pattern in each execution for the same set of data. Namely, the experiments we have developed indicate that the average rate of true detections of application behaviors made by intruders does not exceed 24%. Thus, this multimodal pattern gives a high level of immunity against data analysis attacks because the intruders could consider the generated patterns as the typical patterns.

show abstract

“…Extending dependent types to imperative languages [34,37] has generally led to flow-sensitive type systems because mutation may change the value of a variable referred to in a type. The high burden that flow-sensitive type annotations impose on the programmer motivates sophisticated inference schemes [31], of which CSOLVE [32] is perhaps the closest work to ours.…”

Section: Related Workmentioning

confidence: 99%

Fissile type analysis

Coughlin

Chang

2014

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

We present a generic analysis approach to the imperative relationship update problem, in which destructive updates temporarily violate a global invariant of interest. Such invariants can be conveniently and concisely specified with dependent refinement types, which are efficient to check flow-insensitively. Unfortunately, while traditional flow-insensitive type checking is fast, it is inapplicable when the desired invariants can be temporarily broken. To overcome this limitation, past works have directly ratcheted up the complexity of the type analysis and associated type invariants, leading to inefficient analysis and verbose specifications. In contrast, we propose a generic lifting of modular refinement type analyses with a symbolic analysis to efficiently and effectively check concise invariants that hold almost everywhere. The result is an efficient, highly modular flow-insensitive type analysis to optimistically check the preservation of global relationship invariants that can fall back to a precise, disjunctive symbolic analysis when the optimistic assumption is violated. This technique permits programmers to temporarily break and then re-establish relationship invariants-a flexibility that is crucial for checking relationships in real-world, imperative languages. A significant challenge is selectively violating the global type consistency invariant over heap locations, which we achieve via almost type-consistent heaps. To evaluate our approach, we have encoded the problem of verifying the safety of reflective method calls in dynamic languages as a refinement type checking problem. Our analysis is capable of validating reflective call safety at interactive speeds on commonly-used Objective-C libraries and applications.

show abstract

Inferable object-oriented typed assembly language

Cited by 10 publications

References 20 publications

AUSPICE: Automatic Safety Property Verification for Unmodified Executables

AUSPICE: Automatic Safety Property Verification for Unmodified Executables

Privacy enhancement in anonymous network channels using multimodality injection

Fissile type analysis

Contact Info

Product

Resources

About