Verifying temporal specifications of Java programs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Executable Specifications for Java Programs

In this thesis, we present a unified environment for running declarative specifications in the context of an imperative object-oriented programming language. Specifications are Alloy-like, written in first-order relational logic with transitive closure, and the imperative language for this purpose is Java. By being able to mix imperative code with executable declarative specifications, the user...

متن کامل

Verifying Concurrent Programs against Sequential Specifications

We investigate the algorithmic feasibility of checking whether concurrent implementations of shared-memory objects adhere to their given sequential specifications; sequential consistency, linearizability, and conflict serializability are the canonical variations of this problem. While verifying sequential consistency of systems with unbounded concurrency is known to be undecidable, we demonstra...

متن کامل

JayHorn: A Framework for Verifying Java programs

Building a competitive program verifiers is becoming cheaper. On the front-end side, openly available compiler infrastructure and optimization frameworks take care of hairy problems such as alias analysis, and break down the subtleties of modern languages into a handful of simple instructions that need to be handled. On the back-end side, theorem provers start providing full-fledged model check...

متن کامل

Verifying Multran Programs with Temporal Logic

A coordinationstyle programminglanguage, Multran, and its temporal logic semantics are proposed. Multran uses Linda-like tuple space to coordinate concurrent transactions, which could be written in any language as long as they satisfy their preconditions and post-conditions. It has an intuitional presentation and enjoys a temporal logic semantics for program veriication. A Multran program can b...

متن کامل

Verifying Reachability in Lotos Specifications by Temporal Logic +

A method for verifying reachability properties of distributed system designs specified in the formal description technique LOTOS is proposed. It consists of a linear temporal propositional logic language and a compositional temporal semantics with linear temporal operators. Based on this semantics, both the design specified in LOTOS and its properties can be expressed as logical formulas. Provi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Software Quality Journal

سال: 2020

ISSN: 0963-9314,1573-1367

DOI: 10.1007/s11219-019-09488-9