A model for the yield strength of overaged Al–Zn–Mg–Cu alloys

MJ Starink, SC Wang - Acta Materialia, 2003 - Elsevier
A model for the yield strength of multi-component alloys is presented and applied to
overaged Al–Zn–Mg–Cu alloys (7xxx series). The model is based on an approximation of …

A theory of formal synthesis via inductive learning

S Jha, SA Seshia - Acta Informatica, 2017 - Springer
Formal synthesis is the process of generating a program satisfying a high-level formal
specification. In recent times, effective formal synthesis methods have been proposed based …

Delay-bounded scheduling

M Emmi, S Qadeer, Z Rakamarić - Proceedings of the 38th annual ACM …, 2011 - dl.acm.org
We provide a new characterization of scheduling nondeterminism by allowing deterministic
schedulers to delay their next-scheduled task. In limiting the delays an otherwise …

A model for the electrical conductivity of peak-aged and overaged Al-Zn-Mg-Cu alloys

MJ Starink, XM Li - Metallurgical and Materials Transactions A, 2003 - Springer
A physically based model for the electrical conductivity of peak-aged and overaged Al-Zn-
Mg-Cu (7 xxx series) alloys is presented. The model includes calculations of the η-and the S …

Automata and fixpoints for asynchronous hyperproperties

JO Gutsfeld, M Müller-Olm, C Ohrem - Proceedings of the ACM on …, 2021 - dl.acm.org
Hyperproperties have received increasing attention in the last decade due to their
importance eg for security analyses. Past approaches have focussed on synchronous …

Lazy-cseq: A context-bounded model checking tool for multi-threaded c-programs

O Inverso, TL Nguyen, B Fischer… - 2015 30th IEEE/ACM …, 2015 - ieeexplore.ieee.org
Lazy-CSeq is a context-bounded verification tool for sequentially consistent C programs
using POSIX threads. It first translates a multi-threaded C program into a bounded …

Model-checking parameterized concurrent programs using linear interfaces

S La Torre, P Madhusudan, G Parlato - International Conference on …, 2010 - Springer
We consider the verification of parameterized Boolean programs—abstractions of shared-
memory concurrent programs with an unbounded number of threads. We propose that such …

Getting rid of store-buffers in TSO analysis

MF Atig, A Bouajjani, G Parlato - … , CAV 2011, Snowbird, UT, USA, July 14 …, 2011 - Springer
We propose an approach for reducing the TSO reachability analysis of concurrent programs
to their SC reachability analysis, under some conditions on the explored behaviors. First, we …

Bounded verification of multi-threaded programs via lazy sequentialization

O Inverso, E Tomasco, B Fischer, S La Torre… - ACM Transactions on …, 2021 - dl.acm.org
Bounded verification techniques such as bounded model checking (BMC) have successfully
been used for many practical program analysis problems, but concurrency still poses a …

Context-bounded verification of context-free specifications

P Baumann, M Ganardi, R Majumdar… - Proceedings of the …, 2023 - dl.acm.org
A fundamental problem in refinement verification is to check that the language of behaviors
of an implementation is included in the language of the specification. We consider the …