The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Temporal properties are useful for describing and reasoning about software behavior, but developers rarely write down temporal specifications of their systems. Prior work on inferring specifications developed tools to extract likely program specifications that fit particular kinds of tool-specific templates. This paper introduces Texada, a new temporal specification mining tool for extracting specifications in linear temporal logic (LTL) of arbitrary length and complexity. Texada takes a user-defined LTL property type template and a log of traces as input and outputs a set of instantiations of the property type (i.e., LTL formulas) that are true on the traces in the log. Texada also supports mining of almost invariants: properties with imperfect confidence. We formally describe Texada's algorithms and evaluate the tool's performance and utility.
How it got here
How it got here
agent via openalex
Added
2026-10-26 07:13 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{lemieux2015general,
title = {General LTL Specification Mining (T)},
author = {Caroline Lemieux and Dennis Park and Ivan Beschastnikh},
year = {2015},
journal = {IEEE/ACM International Conference on Automated Software Engineering (ASE)},
pages = {81--92},
doi = {10.1109/ase.2015.71},
}