Roy Armoni

According to our database1, Roy Armoni authored at least 15 papers between 1996 and 2013.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
SVA and PSL Local Variables - A Practical Approach.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2007
Deeper Bound in BMC by Combining Constant Propagation and Abstraction.
Proceedings of the 12th Conference on Asia South Pacific Design Automation, 2007

2006
Design-Intent Coverage - A New Paradigm for Formal Property Verification.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2006

Deterministic Dynamic Monitors for Linear-Time Assertions.
Proceedings of the Formal Approaches to Software Testing and Runtime Verification, 2006

2005
Efficient LTL compilation for SAT-based model checking.
Proceedings of the 2005 International Conference on Computer-Aided Design, 2005

2004
SAT-based Induction for Temporal Safety Properties.
Proceedings of the 2nd International Workshop on Bounded Model Checking, 2004

Formal verification coverage: computing the coverage gap between temporal specifications.
Proceedings of the 2004 International Conference on Computer-Aided Design, 2004

2003
Resets vs. Aborts in Linear Temporal Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Enhanced Vacuity Detection in Linear Temporal Logic.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002
The ForSpec Temporal Logic: A New Temporal Property-Specification Language.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2002

2000
An <i>O</i>(log(<i>n</i>)<sup>4/3</sup>) space algorithm for (<i>s, t</i>) connectivity in undirected graphs.
J. ACM, 2000

1998
On the random resources needed by space bounded computational models (על משאבי האקראיות הדרושים למודלים חישוביים מוגבלי זכרון.).
PhD thesis, 1998

On the Derandomization of Space-Bounded Computations.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

1997
SL <= L<sup>4/3</sup>.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996


  Loading...