Name
Papers
Collaborators
MARCELO F. FRIAS
62
89
Citations 
PageRank 
Referers 
295
35.57
349
Referees 
References 
712
693
Search Limit
100712
Title
Citations
PageRank
Year
Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds.00.342021
Automatically Identifying Sufficient Object Builders from Module APIs.00.342019
Automatically Identifying Sufficient Object Builders from Module APIs.00.342019
Improving lazy abstraction for SCR specifications through constraint relaxation.10.362018
Automated Workarounds from Java Program Specifications Based on SAT Solving.00.342018
On the effect of object redundancy elimination in randomly testing collection classes.00.342018
From operational to declarative specifications using a genetic algorithm.00.342018
Goal-conflict likelihood assessment based on model counting.10.352018
What is a fault? and why does it matter?10.362017
Automated Workarounds from Java Program Specifications Based on SAT Solving.00.342017
An Evolutionary Approach to Translate Operational Specifications into Declarative Specifications.10.342016
Debugging without Testing50.492016
Field-exhaustive testing.40.392016
TacoFlow: optimizing SAT program verification using dataflow analysis20.372015
BLISS: Improved Symbolic Execution by\ Bounded Lazy Initialization with SAT Support140.602015
Model Counting for Complex Data Structures60.442015
On Faults and Faulty Programs.20.372014
Heterogenius : A Framework For Hybrid Analysis Of Heterogeneous Software Specifications20.372014
Bounded exhaustive test input generation from hybrid invariants50.402014
Semantic metrics for software products30.432014
Inference engine based on closure and join operators over Truth Table Binary Relations.00.342014
Dynamite: A tool for the verification of alloy models based on PVS10.342014
Efficient Tight Field Bounds Computation Based on Shape Predicates.20.362014
RepOK-based reduction of bounded exhaustive testing10.352014
Parallel Bounded Verification of Alloy Models by TranScoping.20.392013
TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds240.752013
Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving120.532013
Bounded Lazy Initialization.30.392013
Parallel bounded analysis in code with rich invariants by refinement of field bounds40.412013
Using coverage criteria on RepOK to reduce bounded-exhaustive test suites20.382012
Incorporating coverage criteria in bounded exhaustive black box test generation of structural inputs30.402011
A dataflow analysis to improve SAT-based bounded program verification50.452011
ParAlloy: towards a framework for efficient parallel analysis of alloy models40.432010
Alloy+HotCore: a fast approximation to unsat core60.482010
Dynamite 2.0: new features based on UnSAT-core extraction to improve verification of software requirements30.432010
Describing and Analyzing Behaviours over Tabular Specifications Using (Dyn)Alloy20.432009
Towards Abstraction for DynAlloy Specifications10.362008
Alloy analyzer+PVS in the analysis and verification of alloy specifications100.732007
Efficient Analysis of DynAlloy Specifications120.592007
Interpretability of first-order linear temporal logics in fork algebras50.502006
DynAlloy as a Formal Method for the Analysis of Java Programs120.752006
Monotonicity analysis can speed up verification00.342006
Fork algebras as a sufficiently rich universal institution20.382006
A strategy for efficient verification of relational specifications, based on monotonicity analysis10.362005
Reasoning about static and dynamic properties in alloy: A purely relational approach120.862005
DynAlloy: upgrading alloy with actions571.972005
An Equational Calculus for Alloy90.912004
Taking Alloy to the Movies50.612003
Interpretability of First-Order Dynamic Logic in a Relational Calculus50.552001
How to say Greedy in Fork Algebras00.342000
  • 1
  • 2