Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nicolas Kicillof

dblp:k/NicolasKicillof · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2011
0009-0000-6699-0543ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 6

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Automated reasoning and model checking · 35% Logic in computer science · 35% Automata and formal languages · 30%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
formal specification
0.112005
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties · IEEE Trans. Software Eng. 2005
Automated reasoning and model checking
model checking
0.112005
A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties · IEEE Trans. Software Eng. 2005
Requirements engineering and software design › non-functional requirements
real-time requirements
0.012004
Visual Timed Event Scenarios · ICSE 2004
Requirements engineering and software design
requirements specification
0.012004
Visual Timed Event Scenarios · ICSE 2004
Automata and formal languages
timed automata
0.012004
Visual Timed Event Scenarios · ICSE 2004

Methods — techniques the papers use, named apart from their topics

timed automata · 0.1partial orders · 0.1model checking · 0.1
YearPublicationVenuePosition
2011 Assuring the model evolution of protocol software specifications by regression testing process improvement
abstract
SUMMARY Model‐based testing helps test engineers automate their testing tasks so that they are more cost‐effective. When the model is changed because of the evolution of the specification, it is important to maintain the test suites up to date for regression testing. A complete regeneration of the whole test suite from the new model, although inefficient, is still frequently used in the industry, including Microsoft. To handle specification evolution effectively, we propose a test case reusability analysis technique to identify reusable test cases of the original test suite based on graph analysis. We also develop a test suite augmentation technique to generate new test cases to cover the change‐related parts of the new model. The experiment on four large protocol document testing projects shows that our technique can successfully identify a high percentage of reusable test cases and generate low‐redundancy new test cases. When compared with a complete regeneration of the whole test suite, our technique significantly reduces regression testing time while maintaining the stability of requirement coverage over the evolution of requirements specifications. Copyright © 2011 John Wiley & Sons, Ltd.
Bo Jiang 0001, T. H. Tse, Wolfgang Grieskamp, Nicolas Kicillof, Wing Kwong Chan
Softw. Pract. Exp.4
2011 Model-based quality assurance of protocol documentation: tools and methodology
abstract
Abstract Microsoft is producing interoperability documentation for Windows client–server and server–server protocols. The Protocol Engineering Team in the Windows organization is responsible for verifying the documentation to ensure that it is of the highest quality. Various test‐driven methods are being applied including, when appropriate, a model‐based approach. This paper describes core aspects of the quality assurance process and tools that were put in place, and specifically focuses on model‐based testing (MBT). Experience so far confirms that MBT works and that it scales, provided it is accompanied by sound tool support and clear methodological guidance. Copyright © 2010 John Wiley & Sons, Ltd.
Wolfgang Grieskamp, Nicolas Kicillof, Keith Stobie, Víctor A. Braberman
Softw. Test. Verification Reliab.2
2008 Model-Based Quality Assurance of Windows Protocol Documentation
abstract
Microsoft is producing high-quality documentation for Windows client-server and server-server protocols. Our group in the Windows organization is responsible for verifying the documentation to ensure it is of the highest quality. We are applying various test-driven methods including, when appropriate, a model-based approach. This paper describes certain aspects of the quality assurance process we put in place, and specifically focuses on model-based testing (MBT). Our experiences so far confirm that MBT works and that it scales, provided it is accompanied by sound tool support and clear methodological guidance.
Wolfgang Grieskamp, Nicolas Kicillof, Dave MacDonald, Alok Nandan, Keith Stobie, Fred L. Wurden
ICST2
2006 Action Machines: a Framework for Encoding and Composing Partial Behaviors
abstract
We describe action machines, a framework for encoding and composing partial behavioral descriptions. Action machines encode behavior as a variation of labeled transition systems where the labels are observable activities of the described artifact and the states capture full data models. Labels may also have structure, and both labels and states may be partial with a symbolic representation of the unknown parts. Action machines may stem from software models or programs, and can be composed in a variety of ways to synthesize new behaviors. The composition operators described here include synchronized and interleaving parallel composition, sequential composition, and alternating simulation. We use action machines in analysis processes such as model checking and model-based testing. The current main application is in the area of model-based conformance testing, where our approach addresses practical problems users at Microsoft have in applying model-based testing technology.
Wolfgang Grieskamp, Nicolas Kicillof, Nikolai Tillmann
Int. J. Softw. Eng. Knowl. Eng.2
2005 A Scenario-Matching Approach to the Description and Model Checking of Real-Time Properties
abstract
A major obstacle in the technology transfer agenda of behavioral analysis and design methods is the need for logics or automata to express properties for control-intensive systems. Interaction-modeling notations may offer a replacement or a complement, with a practitioner-appealing and lightweight flavor, due partly to the sub specification of intended behavior by means of scenarios. We propose a novel approach consisting of engineering a new formal notation of this sort based on a simple compact declarative semantics: VTS (visual timed event scenarios). Scenarios represent event patterns, graphically depicting conditions over traces. They predicate general system events and provide features to describe complex properties not expressible with MSC-like notations. The underlying formalism supports partial orders and real-time constraints. The problem of checking whether a timed-automaton model has a matching trace is proven decidable. On top of this kernel, we introduce a notation to state properties over all system traces: conditional scenarios, allowing engineers to describe uniquely rich connections between antecedent and consequent portions of the scenario. An undecidability result is presented for the general case of the model-checking problem over dense-time domains, to later identify a decidable-yet practically relevant-subclass, where verification is solvable by generating antiscenarios expressed in the VTS-kernel notation.
Víctor A. Braberman, Nicolas Kicillof, Alfredo Olivero
IEEE Trans. Software Eng.2
2004 Visual Timed Event Scenarios
abstract
Formal description of real-time requirements is a difficult and error prone task. Conceptual and tool support for this activity plays a central role in the agenda of technology transference from the formal verification engineering community to the real-time systems development practice. In this article we present VTS, a visual language to define complex event-based requirements such as freshness, bounded response, event correlation, etc. The underlying formalism is based on partial orders and supports real-time constraints. The problem of checking whether a timed automaton model of a system satisfies these sort of scenarios is shown to be decidable. Moreover, we have also developed a tool that translates visually specified scenarios into observer timed automata. The resulting automata can be composed with a model under analysis in order to check satisfaction of the stated scenarios. We show the benefits of applying these ideas to some case studies.
Alejandra Alfonso, Víctor A. Braberman, Nicolas Kicillof, Alfredo Olivero
ICSE3