CVC4 - User contributions [en]

Support

2017-02-08T18:21:53Z

Mattarei: /* Technical Support */

=Technical Support=

Please send all bug reports to [mailto:cvc-bugs@cs.stanford.edu cvc-bugs@cs.nyu.edu], or use the [http://cvc4.cs.stanford.edu/bugzilla3/ CVC4 Bugzilla tracker].
If you have a question, a feature request, or would like to contribute in some way,
please contact one of the project leaders.

=Mailing List=

[http://www.cs.nyu.edu/mailman/listinfo/cvc-users The CVC-USERS list] is for users of CVC3 and CVC4.
We will make periodic announcements to this list and users are also encouraged to use it for discussion.

Strings

2017-02-08T18:17:18Z

Mattarei: /* API */

This page describes support for the theory of strings in CVC4.

=Syntax=
This document focuses on input written in SMT-LIB 2 format.
A frontend for CVC4's native syntax is not available yet.

'''We highly recommend that users use SMT-LIB [http://smt-lib.org/language.shtml Version 2.5],
instead of Version 2.0.'''
The major difference is in the definition of escape sequences for string literals.

'''The syntax below is for CVC4 version > 1.4.''' Version 1.3 has only
''partial'' support for syntax in this document.

Since the string (sub)solver is still relatively new, the current stable version
of CVC4 (1.4) does not provide the latest version of that solver.
Please use our latest Development version instead.

Currently, the string solver supports string constants over a set of characters
limited to the printable ASCII characters. Other characters ''must'' be encoded
with escape sequences.
For arbitry alphabets, we plan to provide later a separate solver
for a theory of parametric sequences.

To use the string solver it is important to declare initially
(using the <code>set-logic</code> command) an SMT-LIB logic that includes strings.
Since the SMT-LIB standard does not have an official theory of strings and
related logics yet, the logic names described below are tentative and
might change later.

The basic logic is <code>QF_S</code> consisting of quantifier-free formulas
over just the theory of strings, e.g.:
(set-logic QF_S)

A summary of the relevant syntax for strings in the SMT2, CVC, and API is below. Note that regular expressions are not yet supported in the CVC format. More details on these operators can be found later in this page.

{| class="wikitable" cellpadding="5" border="0" style="border-collapse:collapse"
|-
!
! CVC language
! SMTLIB language
! C++ API
|-
| Logic string
| Not needed
| preappend "S" for strings
| preappend "S" for strings
|-
|
|
| <code>(set-logic QF_'''S'''LIA)</code>
| <code>smt.setLogic("QF_'''S'''LIA");</code>
|-
| String Sort
| <code>STRING</code>
| <code>String</code>
| <code>em.stringType();</code>
|-
| String literals
| <code>"abcdef"</code>
| <code>"abcdef"</code>
| <code>em.mkConst( '''::CVC4::String'''("abcdef") );</code>
|-
| Concatenation
| <code>'''CONCAT'''( X1, ..., Xn )</code>
| <code>('''str.++''' X1 ... Xn )</code>
| <code>em.mkExpr('''kind::STRING_CONCAT''', X1, ..., Xn);</code>
|-
| Length
| <code>'''LENGTH'''( x )</code>
| <code>('''str.len''' X)</code>
| <code>em.mkExpr('''kind::STRING_LENGTH''', X);</code>
|-
| String contains
| <code>'''CONTAINS'''( X, Y )</code>
| <code>('''str.contains''' X Y)</code>
| <code>em.mkExpr('''kind::STRING_STRCTN''', X, Y);</code>
|-
| Index of
| <code>'''INDEXOF'''( X, Y, N )</code>
| <code>('''str.indexof''' X Y N)</code>
| <code>em.mkExpr('''kind::STRING_STRIDOF''', X, Y, N);</code>
|-
| Replace
| <code>'''REPLACE'''( X, Y, Z )</code>
| <code>('''str.replace''' X Y Z)</code>
| <code>em.mkExpr('''kind::STRING_STRREPL''', X, Y, Z);</code>
|-
| Substring
| <code>'''SUBSTR'''( X, Y )</code>
| <code>('''str.substr''' X Y)</code>
| <code>em.mkExpr('''kind::STRING_SUBSTR''', X, Y);</code>
|-
| Prefix of
| <code>'''PREFIXOF'''( X, Y )</code>
| <code>('''str.prefixof''' X Y)</code>
| <code>em.mkExpr('''kind::STRING_PREFIX''', X, Y);</code>
|-
| Suffix of
| <code>'''SUFFIXOF'''( X, Y )</code>
| <code>('''str.suffixof''' X Y)</code>
| <code>em.mkExpr('''kind::STRING_SUFFIX''', X, Y);</code>
|-
| String to Integer
| <code>'''STRING_TO_INTEGER'''( X )</code>
| <code>('''str.to.int''' X)</code>
| <code>em.mkExpr('''kind::STRING_STOI''', X);</code>
|-
| Integer to String
| <code>'''INTEGER_TO_STRING'''( X )</code>
| <code>('''int.to.str''' X)</code>
| <code>em.mkExpr('''kind::STRING_ITOS''', X);</code>
|-
| String to Integer (16-bit)
| <code>'''STRING_TO_UINT16'''( X )</code>
| <code>('''str.to.u16''' X)</code>
| <code>em.mkExpr('''kind::STRING_STOU16''', X);</code>
|-
| Integer (16-bit) to String
| <code>'''UINT16_TO_STRING'''( X )</code>
| <code>('''u16.to.str''' X)</code>
| <code>em.mkExpr('''kind::STRING_U16TOS''', X);</code>
|-
| String to Integer (32-bit)
| <code>'''STRING_TO_UINT32'''( X )</code>
| <code>('''str.to.u32''' X)</code>
| <code>em.mkExpr('''kind::STRING_STOU32''', X);</code>
|-
| Integer (32-bit) to String
| <code>'''UINT32_TO_STRING'''( X )</code>
| <code>('''u32.to.str''' X)</code>
| <code>em.mkExpr('''kind::STRING_U32TOS''', X);</code>
|-
| Character at
| <code>'''CHARAT'''( X, N )</code>
| <code>('''str.at''' X N)</code>
| <code>em.mkExpr('''kind::STRING_CHARAT''', X, N);</code>
|-
| Regular expression sort
| <code>n/a</code>
| <code>RegExp</code>
| <code>em.regExpType();</code>
|-
| Membership in regular expression
| <code>n/a</code>
| <code>('''str.in.re''' X R)</code>
| <code>em.mkExpr('''kind::STRING_IN_REGEXP''', X, R);</code>
|-
| String to regular expression
| <code>n/a</code>
| <code>('''str.to.re''' X)</code>
| <code>em.mkExpr('''kind::STRING_TO_REGEXP''', X);</code>
|-
| Regular expression concatenation
| <code>n/a</code>
| <code>('''re.++''' R1 ... Rn)</code>
| <code>em.mkExpr('''kind::REGEXP_CONCAT''', R1, ..., Rn);</code>
|-
| Regular expression union
| <code>n/a</code>
| <code>('''re.union''' R1 ... Rn)</code>
| <code>em.mkExpr('''kind::REGEXP_UNION''', R1, ..., Rn);</code>
|-
| Regular expression intersection
| <code>n/a</code>
| <code>('''re.inter''' R1 ... Rn)</code>
| <code>em.mkExpr('''kind::REGEXP_INTER''', R1, ..., Rn);</code>
|-
| Regular expression Kleene star
| <code>n/a</code>
| <code>('''re.*''' R)</code>
| <code>em.mkExpr('''kind::REGEXP_STAR''', R);</code>
|-
| Regular expression plus
| <code>n/a</code>
| <code>('''re.+''' R)</code>
| <code>em.mkExpr('''kind::REGEXP_PLUS''', R);</code>
|-
| Regular expression option
| <code>n/a</code>
| <code>('''re.opt''' R)</code>
| <code>em.mkExpr('''kind::REGEXP_OPT''', R);</code>
|}

==Options==
Some functions in the theory are have only experimental support currently and
are disabled by default (even in the <code>ALL_SUPPORTED</code> logic:
To use them:
(set-option :strings-exp true)

The solver can be run in ''finite model finding mode'' which guarantees
termination for satisfiable problems.
This mode is disabled by default. To enable it:
(set-option :strings-fmf true)
Note that in this mode the solver is much '''slower''' than in default mode,
so we recommend it only as a fall back option when the default mode fails
to find a solution with a reasonably large timeout.

To select the strategy of LB rule application: 0-lazy, 1-eager, 2-no (0 by default):
(set-option :strings-lb 1)

To set up string alphabet cardinality (256 by default, expert option):
(set-option :strings-alphabet-card n)
This is a reserved option for the extension of the sequence theory.

==Alphabet==
Currently, the solver's theory is based on an alphabet consisting of the 256
characters from (8-bit) Extended ASCII.
Since there are several versions of Extended ASCII, we allow string constants
to contain only ''printable US ASCII characters'', which are encoded
in the same way in all Extended ASCII versions.

'''Note:''' The alphabet will change to the one prescribed by the SMT-LIB standard
once there is one.

==Printable Characters==
A ''printable'' character is any character with numerical value between 0x20 and 0x7e
in the standard US ASCII encoding.

==Escape Sequences in String Constants==
String constants are denoted by SMT-LIB string literals consisting of sequences of printable characters delimited by double-quotes (<code>"</code>).

We support escape sequences used in most programming languages
to represent non-printable characters.

{| border="1"
|-
| <code>\0</code> … <code>\9</code>
| represents ASCII character 0 … 9, respectively
|-
| <code>\a</code>, <code>\b</code>, <code>\e</code>, <code>\f</code>, <code>\n</code>, <code>\r</code>, <code>\t</code>, <code>\v</code>
| represents its corresponding ASCII character (C++ convention)
|-
| <code>\</code>''ooo''
| encodes a single ASCII character where ''ooo'' consists of exactly three digits in the octal encoding of the character (from 0 to 377). For example, <code>\101</code> represents <code>A</code>. '''Note:''' going beyond value 377 might give unexpected results. For instance, <code>\437</code> will be translated in the two-character string <code>#7</code>.
|-
| <code>\x</code>''NN''
| encodes a single ASCII character, where ''NN'' consists of exactly two digits in the exadecimal encoding of the character.
|}

The backslash character (<code>\</code>) is silently ignored when it is followed by a sequence of characters not recognized as an escape sequence. For example, <code>\$ </code>, say, is parsed as if it was just <code>$</code>.

When CVC4 outputs a string constant, a non-printable/extended ASCII character is printed in the exadecimal format <code>\x</code>''NN'', except for the character denoted by the escape sequences <code>\a</code>, <code>\b</code>, <code>\e</code>, <code>\f</code>, <code>\n</code>, <code>\r</code>, <code>\t</code>, <code>\v</code>, which are printed using those escape sequences.

'''Note''':
These escape sequences are specific to string constants in the theory of strings. They are 'not' escape sequences in SMT-LIB 2 per se.
SMT-LIB 2.5 has only one escape sequence for string literals: <code>""</code>,
which denotes the double quotes character.
This means that a string literal like <code>"a""c"</code> is read by the solver as the string constant consisting of the characters <code>a</code>, <code>"</code>, and <code>c</code>.
The same constant can be entered as <code>"a\042c"</code> or <code>"a\x22c"</code>.

==Theory Signature==
To define a string variable, i.e., a free string constant:
(declare-fun x () String)
Alternatively:
(declare-const x () String)

String Concatenation:
(str.++ s1 s2 ... sn)
where s1, s2, ..., and sn are string terms. String concatenation takes at least 2 arguments.

String Length:
(str.len s)
where s is a string term.

Character in String:
(str.at s i)
where s is a string term and i is an integer.
The index is starting from 0.

Sub-String:
(str.substr s i j )
where s is a string term, i and j are integers.

==Escape Sequences for Regular Expressions==
Currently, it is for CVC format only. (Coming soon.)

==Symbolic Regular Expression==
Membership Constraint:
(str.in.re s r)
where s is a string term and r is a regular expression.

String to Regular Expression Conversion:
(str.to.re s)
where s is a string term. The statement turns a regular expression that only contains a string s.

Regular Expression Concatenation:
(re.++ r_1 r_2 ... r_n)
where r_1, r_2, ..., r_n are regular expressions.

Regular Expression Alternation:
(re.union r_1 r_2 ... r_n)
where r_1, r_2, ..., r_n are regular expressions. re.or is for releases before March, 2014.

Regular Expression Intersection:
(re.inter r_1 r_2 ... r_n)
where r_1, r_2, ..., r_n are regular expressions. re.itr is for releases before March, 2014.

Regular Expression Kleene-Star:
(re.* r)
where r is a regular expression.

Regular Expression Kleene-Cross:
(re.+ r)
where r is a regular expression.

Regular Expression Option:
(re.opt r)
where r is a regular expression.

Regular Expression Range:
(re.range s t)
where s, t are single characters in double quotes, e.g. "a", "b".
It returns a regular expression that contains any character between s and t.

Regular Expression Loop:
(re.loop r l u)
where r is a regular expression, l is a non-negative constant integer, and u is a non-negative constant integer.
It returns a regular expression that contains at least l repetitions of r and at most u repetitions of r.
If l >= u, it returns exactly l repetitions of r.

Regular Expression Loop-2:
(re.loop r l)
where r is a regular expression, and l is a non-negative constant integer.
It returns a regular expression that contains at least l repetitions of r.

The Empty Regular Expression:
re.nostr

The Regular Expression that contains all characters:
re.allchar

==Experimental Mode==
Following functions are under the --strings-exp option. They are under active refinement. Once they are stable, we will move them to the default mode. Please let us know when you have some suggestions.

String Char-At:
(str.at s i)
where s is a string term and i is an integer term. i is the position. If i is negative or greater than or equal to the length of s, then (str.at s i) returns the empty string.

String Sub-string:
(str.substr s i j)
where s is a string term and i, j are integer terms. i is the starting position, and j is the offset. If i is negative, it returns the empty string; otherwise, it returns the substring (of s) that begins at the specified index i and extends to the length j (or to the last character of s if the length of s is shorter than i + j).

String Contain:
(str.contains s t)
where s and t are string terms. It returns true if the string s contains the string t.
This function determines whether the string t can be found within the string s, returning true or false as appropriate.

String IndexOf:
(str.indexof s t i)
where s is a string, t is a non-empty string and i is a non-negative integer.
This function returns the position of the first occurrence of the specified value t in the string s after the index i.
It returns -1 if the value to search for does not occur.

String Replacement:
(str.replace s t1 t2)
where s, t1 and t2 are string terms, t1 is non-empty.
This function searches the string s for the specified value t1, and returns a new string where the first occurrence of the specified value t1 is replaced by the string t2.

String PrefixOf:
(str.prefixof s t)
where s and t are string terms. It returns true if the string s is a prefix of the string t.

String SuffixOf:
(str.suffixof s t)
where s and t are string terms. It returns true if the string s is a suffix of the string t.

String To Integer Conversion:
(str.to.int s)
where s is a string term. It returns the corresponding natural number if s is string of digits; otherwise, it returns -1.

Integer To String Conversion:
(int.to.str i)
where i is an integer term. It returns the corresponding string if i is a natural number; otherwise, it returns an empty string.

=Extensions=
Together with other engine in CVC4, we can extend new functionality in the theory of strings. For example,
(define-fun fun1 ((?x String) (?s String)) Bool
(or (= ?x ?s)
(> (str.len ?x) (str.len ?s))
))
Quantifiers over bounded Integers (with strings in the body) are supported in the experimental mode; however, quantifiers over strings are still under development.

=Limitations=
The decidability of this theory is unknown.
For satisfiable problems (without extensions), our solver is sound, complete and terminating in the FMF mode (although the FMF mode will be slower than the default mode in general). For unsatisfiable problems, termination is not guaranteed; however, users can tune the options for termination.

The current version of the solver supports ASCII characters only. We might move on to UNICODE in future versions.

=Examples=
Find an assignment for x, where x."ab"="ba".x and the length of x equals to 7.
(set-logic QF_S)

(declare-fun x () String)

(assert (= (str.++ x "ab") (str.++ "ba" x)))
(assert (= (str.len x) 7))

(check-sat)

Find assignments for x and y, where x and y are distinct and their lengths are equal.
(set-logic QF_S)

(declare-fun x () String)
(declare-fun y () String)

(assert (not (= x y)))
(assert (= (str.len x) (str.len y)))

(check-sat)

Find assignments for x and y, where x.y != y.x.
(set-logic QF_S)

(declare-fun x () String)
(declare-fun y () String)
(assert (not (= (str.++ x y) (str.++ y x))))

(check-sat)

Find a model for x, y and z, where x."ab".y=y."ba".z and z=x.y and x."a"!="a".x.
(set-logic QF_S)

(declare-fun x () String)
(declare-fun y () String)
(declare-fun z () String)

(assert (= (str.++ x "ab" y) (str.++ y "ba" z)))
(assert (= z (str.++ x y)))
(assert (not (= (str.++ x "a") (str.++ "a" x))))

(check-sat)

Find a model for x and y, where both x and y are in the RegEx (a*b)* and they are different but have the same length.
(set-logic QF_S)
(set-option :strings-fmf true)

(declare-fun x () String)
(declare-fun y () String)

(assert
(str.in.re x
(re.* (re.++ (re.* (str.to.re "a") ) (str.to.re "b") ))))
(assert (str.in.re y
(re.* (re.++ (re.* (str.to.re "a") ) (str.to.re "b") ))))

(assert (not (= x y)))
(assert (= (str.len x) (str.len y)))

(check-sat)

=API=
More details can be found in the [http://cvc4.cs.stanford.edu/wiki/Tutorials Tutorials].

==C++==
The example can be found in [https://github.com/CVC4/CVC4/blob/master/examples/api/strings.cpp examples/api/strings.cpp].

If setting the logic, use "S" to enable theory of strings.
smt.setLogic("S");

To create a string type, call <code>mkSetType</code> in the <code>ExprManager</code>.
Type string = em.stringType();

Make some string literals:
// std::string
std::string std_str_ab("ab");
// CVC4::String
CVC4::String cvc4_str_ab(std_str_ab);
CVC4::String cvc4_str_abc("abc");
// String constants
Expr ab = em.mkConst(cvc4_str_ab);
Expr abc = em.mkConst(CVC4::String("abc"));

Make some string variables:
Expr x = em.mkVar("x", string);
Expr y = em.mkVar("y", string);
Expr z = em.mkVar("z", string);

Make some string constraints:
// String concatenation: x.ab.y
Expr lhs = em.mkExpr(kind::STRING_CONCAT, x, ab, y);
// String concatenation: abc.z
Expr rhs = em.mkExpr(kind::STRING_CONCAT, abc, z);
// x.ab.y = abc.z
Expr formula1 = em.mkExpr(kind::EQUAL, lhs, rhs);
// Length of y: |y|
Expr leny = em.mkExpr(kind::STRING_LENGTH, y);
// |y| >= 0
Expr formula2 = em.mkExpr(kind::GEQ, leny, em.mkConst(Rational(0)));
// Regular expression: (ab[c-e]*f)|g|h
Expr r = em.mkExpr(kind::REGEXP_UNION,
em.mkExpr(kind::REGEXP_CONCAT,
em.mkExpr(kind::STRING_TO_REGEXP, em.mkConst(String("ab"))),
em.mkExpr(kind::REGEXP_STAR,
em.mkExpr(kind::REGEXP_RANGE, em.mkConst(String("c")), em.mkConst(String("e")))),
em.mkExpr(kind::STRING_TO_REGEXP, em.mkConst(String("f")))),
em.mkExpr(kind::STRING_TO_REGEXP, em.mkConst(String("g"))),
em.mkExpr(kind::STRING_TO_REGEXP, em.mkConst(String("h"))));
// String variables
Expr s1 = em.mkVar("s1", string);
Expr s2 = em.mkVar("s2", string);
// String concatenation: s1.s2
Expr s = em.mkExpr(kind::STRING_CONCAT, s1, s2);
// s1.s2 in (ab[c-e]*f)|g|h
Expr formula3 = em.mkExpr(kind::STRING_IN_REGEXP, s, r);

Make a query:
Expr q = em.mkExpr(kind::AND,
formula1,
formula2,
formula3);

Check the result:
Result result = smt.checkSat(q);
std::cout << "CVC4 reports: " << q << " is " << result << "." << std::endl;
if(result == Result::SAT) {
std::cout << " x = " << smt.getValue(x) << std::endl;
std::cout << " s1.s2 = " << smt.getValue(s) << std::endl;
}

==Java==
The example can be found in [https://github.com/CVC4/CVC4/blob/master/examples/api/java/Strings.java examples/api/java/Strings.java].

==Unsat Cores==
The string solver supports the generation of unsatisfiable cores.
As with other subsolvers though, you must enable proofs at configuration time,
and then run CVC with "--dump-unsat-cores" flag.

=References=
* Tianyi Liang, Andrew Reynolds, Nestan Tsiskaridze, Cesare Tinelli, Clark Barrett, and Morgan Deters. [http://dl.acm.org/citation.cfm?id=2994123 An efficient SMT solver for string constraints]. Formal Methods in System Design. 2016.
* Tianyi Liang, Nestan Tsiskaridze, Andrew Reynolds, Cesare Tinelli, and Clark Barrett. [http://link.springer.com/chapter/10.1007/978-3-319-24246-0_9 A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings]. In Proceedings of the 10th International Symposium on Frontiers of Combining Systems (FroCoS'15), Wroclaw, Poland, 2015.
* Tianyi Liang, Andrew Reynolds, Cesare Tinelli, Clark Barrett and Morgan Deters. [http://link.springer.com/chapter/10.1007%2F978-3-319-08867-9_43 A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions].In Proceedings of the 26th International Conference on Computer Aided Verification (CAV'14), Vienna, Austria, 2014.
* Tianyi Liang. [http://ir.uiowa.edu/etd/1478/ Automated reasoning over string constraints]. PhD Dissertation, Department of Computer Science, The University of Iowa, Dec 2014.

How do I... ?

2017-02-08T18:12:21Z

Mattarei: /* Dealing with the services on the CVC4 Stanford server */

This page is a repository for questions about working with CVC4. If you have a question, please add it here. If you have an answer, please add the answer to the [[Developer's Guide]], or another wiki page, and then link to it from here.

=Dealing with ANTLR3=

*[[Developer's Guide#ANTLR3|...get ANTLR3 to work?]]

=Dealing with the build process=

*[[Developer's Guide#Working with multiple, concurrent build profiles|...build a different CVC4 build profile than the "current" one?]]

=Dealing with Subversion=

*[[Developer's Guide#Accessing CVC4's repository|...check out CVC4 from the repository?]]
*[[Developer's Guide#Repository access from Eclipse|...access the repository from Eclipse?]]
*[[Developer's Guide#Browsing the repository|...browse CVC4 sources online?]]
*[[Developer's Guide#Accessing CVC4's repository|...update my working copy to the newest committed version?]]
*[[Developer's Guide#Working with files and directories|...rename a file or directory?]]
*[[Developer's Guide#Reverting a file in a working directory|...revert changes in my working directory?]]
*[[Developer's Guide#Reverting a commit|...revert changes that have already been committed to the repository?]]
*[[Developer's Guide#Accessing CVC4's repository|...see what I've changed in my working copy?]]
*[[Developer's Guide#Resolving conflicts in a working directory|...resolve a conflict?]]
*[[Developer's Guide#Creating a branch|...create a branch?]]
*[[Developer's Guide#Merging a branch back to the trunk|...merge a branch back into the trunk?]]
*[[Developer's Guide#Symbolically tagging a version|...symbolically tag a version?]]
*[[Developer's Guide#Marking a file as executable in Subversion|...make Subversion recognize that a file should be executable?]]

=Dealing with the source tree=

*[[Developer's Guide#Adding a new Theory|...add support for a new theory to CVC4?]]
*[[Developer's Guide#Adding source directories|...add a new source directory to the tree?]]
*[[Developer's Guide#Adding source and header files|...add a new source file to the tree?]]
*[[Developer's Guide#Adding copyrighted sources|...add a new source file/directory to the tree from another project (under different copyright)?]]
*[[Developer's Guide#update-copyright.pl|...update the copyright information at the top of each file in the tree?]]

=Dealing with tests=

*[[Developer's Guide#Unit testing|...add a new unit test?]]
*[[Developer's Guide#System testing|...add a new system regression?]]
*[[Developer's Guide#Regression testing|...add a new regression?]]
*[[Developer's Guide#Debugging unit tests|...attach a debugger to unit tests?]]
*[[Developer's Guide#Test rebuilding|...avoid rebuilding all tests after trivial code changes to the library?]]
*[[Developer's Guide#Compile-time errors in unit tests|...deal with this strange compile error on my unit test?]]

=Dealing with code coverage=

*[[Developer's Guide#Visualizing code coverage|...visualize code coverage?]]

=Dealing with performance=

*[[Developer's Guide#Profiling|...profile CVC4?]]

=Dealing with the main CVC4 driver program=

*[[Developer's Guide#Command-line options|...add a new command-line option?]]

=Dealing with code reviews=

*[[Developer's Guide#Code reviews|...perform a code review?]]

=Dealing with the services on the Church server=

'''NOTE: This information is deprecated but we might want to review it.'''



*[[Developer Meeting Minutes#Adding meeting minutes to the wiki|...add CVC4 meeting minutes to the wiki?]]
*[[Developer Meeting Minutes#Adding electronic notes to meeting minutes|...add electronic notes to CVC4 meeting minutes?]]
*[[Running a CVC4 Meeting|...run a CVC4 meeting?]]

= Dealing with adding a new theory =
For information on how to add a new theory see [[How to write a theory in CVC4]].

How do I... ?

2017-02-03T05:47:32Z

Mattarei: /* Dealing with the services on the CVC4 Stanford server */

This page is a repository for questions about working with CVC4. If you have a question, please add it here. If you have an answer, please add the answer to the [[Developer's Guide]], or another wiki page, and then link to it from here.

=Dealing with ANTLR3=

*[[Developer's Guide#ANTLR3|...get ANTLR3 to work?]]

=Dealing with the build process=

*[[Developer's Guide#Working with multiple, concurrent build profiles|...build a different CVC4 build profile than the "current" one?]]

=Dealing with Subversion=

*[[Developer's Guide#Accessing CVC4's repository|...check out CVC4 from the repository?]]
*[[Developer's Guide#Repository access from Eclipse|...access the repository from Eclipse?]]
*[[Developer's Guide#Browsing the repository|...browse CVC4 sources online?]]
*[[Developer's Guide#Accessing CVC4's repository|...update my working copy to the newest committed version?]]
*[[Developer's Guide#Working with files and directories|...rename a file or directory?]]
*[[Developer's Guide#Reverting a file in a working directory|...revert changes in my working directory?]]
*[[Developer's Guide#Reverting a commit|...revert changes that have already been committed to the repository?]]
*[[Developer's Guide#Accessing CVC4's repository|...see what I've changed in my working copy?]]
*[[Developer's Guide#Resolving conflicts in a working directory|...resolve a conflict?]]
*[[Developer's Guide#Creating a branch|...create a branch?]]
*[[Developer's Guide#Merging a branch back to the trunk|...merge a branch back into the trunk?]]
*[[Developer's Guide#Symbolically tagging a version|...symbolically tag a version?]]
*[[Developer's Guide#Marking a file as executable in Subversion|...make Subversion recognize that a file should be executable?]]

=Dealing with the source tree=

*[[Developer's Guide#Adding a new Theory|...add support for a new theory to CVC4?]]
*[[Developer's Guide#Adding source directories|...add a new source directory to the tree?]]
*[[Developer's Guide#Adding source and header files|...add a new source file to the tree?]]
*[[Developer's Guide#Adding copyrighted sources|...add a new source file/directory to the tree from another project (under different copyright)?]]
*[[Developer's Guide#update-copyright.pl|...update the copyright information at the top of each file in the tree?]]

=Dealing with tests=

*[[Developer's Guide#Unit testing|...add a new unit test?]]
*[[Developer's Guide#System testing|...add a new system regression?]]
*[[Developer's Guide#Regression testing|...add a new regression?]]
*[[Developer's Guide#Debugging unit tests|...attach a debugger to unit tests?]]
*[[Developer's Guide#Test rebuilding|...avoid rebuilding all tests after trivial code changes to the library?]]
*[[Developer's Guide#Compile-time errors in unit tests|...deal with this strange compile error on my unit test?]]

=Dealing with code coverage=

*[[Developer's Guide#Visualizing code coverage|...visualize code coverage?]]

=Dealing with performance=

*[[Developer's Guide#Profiling|...profile CVC4?]]

=Dealing with the main CVC4 driver program=

*[[Developer's Guide#Command-line options|...add a new command-line option?]]

=Dealing with code reviews=

*[[Developer's Guide#Code reviews|...perform a code review?]]

=Dealing with the services on the CVC4 Stanford server=

'''NOTE: This information is deprecated but we might want to review it.'''



*[[Developer Meeting Minutes#Adding meeting minutes to the wiki|...add CVC4 meeting minutes to the wiki?]]
*[[Developer Meeting Minutes#Adding electronic notes to meeting minutes|...add electronic notes to CVC4 meeting minutes?]]
*[[Running a CVC4 Meeting|...run a CVC4 meeting?]]

= Dealing with adding a new theory =
For information on how to add a new theory see [[How to write a theory in CVC4]].

How do I... ?

2017-02-03T05:44:58Z

Mattarei: /* Dealing with the services on the Church server */

This page is a repository for questions about working with CVC4. If you have a question, please add it here. If you have an answer, please add the answer to the [[Developer's Guide]], or another wiki page, and then link to it from here.

=Dealing with ANTLR3=

*[[Developer's Guide#ANTLR3|...get ANTLR3 to work?]]

=Dealing with the build process=

*[[Developer's Guide#Working with multiple, concurrent build profiles|...build a different CVC4 build profile than the "current" one?]]

=Dealing with Subversion=

*[[Developer's Guide#Accessing CVC4's repository|...check out CVC4 from the repository?]]
*[[Developer's Guide#Repository access from Eclipse|...access the repository from Eclipse?]]
*[[Developer's Guide#Browsing the repository|...browse CVC4 sources online?]]
*[[Developer's Guide#Accessing CVC4's repository|...update my working copy to the newest committed version?]]
*[[Developer's Guide#Working with files and directories|...rename a file or directory?]]
*[[Developer's Guide#Reverting a file in a working directory|...revert changes in my working directory?]]
*[[Developer's Guide#Reverting a commit|...revert changes that have already been committed to the repository?]]
*[[Developer's Guide#Accessing CVC4's repository|...see what I've changed in my working copy?]]
*[[Developer's Guide#Resolving conflicts in a working directory|...resolve a conflict?]]
*[[Developer's Guide#Creating a branch|...create a branch?]]
*[[Developer's Guide#Merging a branch back to the trunk|...merge a branch back into the trunk?]]
*[[Developer's Guide#Symbolically tagging a version|...symbolically tag a version?]]
*[[Developer's Guide#Marking a file as executable in Subversion|...make Subversion recognize that a file should be executable?]]

=Dealing with the source tree=

*[[Developer's Guide#Adding a new Theory|...add support for a new theory to CVC4?]]
*[[Developer's Guide#Adding source directories|...add a new source directory to the tree?]]
*[[Developer's Guide#Adding source and header files|...add a new source file to the tree?]]
*[[Developer's Guide#Adding copyrighted sources|...add a new source file/directory to the tree from another project (under different copyright)?]]
*[[Developer's Guide#update-copyright.pl|...update the copyright information at the top of each file in the tree?]]

=Dealing with tests=

*[[Developer's Guide#Unit testing|...add a new unit test?]]
*[[Developer's Guide#System testing|...add a new system regression?]]
*[[Developer's Guide#Regression testing|...add a new regression?]]
*[[Developer's Guide#Debugging unit tests|...attach a debugger to unit tests?]]
*[[Developer's Guide#Test rebuilding|...avoid rebuilding all tests after trivial code changes to the library?]]
*[[Developer's Guide#Compile-time errors in unit tests|...deal with this strange compile error on my unit test?]]

=Dealing with code coverage=

*[[Developer's Guide#Visualizing code coverage|...visualize code coverage?]]

=Dealing with performance=

*[[Developer's Guide#Profiling|...profile CVC4?]]

=Dealing with the main CVC4 driver program=

*[[Developer's Guide#Command-line options|...add a new command-line option?]]

=Dealing with code reviews=

*[[Developer's Guide#Code reviews|...perform a code review?]]

=Dealing with the services on the CVC4 Stanford server=

'''NOTE: This information is deprecated but we might want to review it.'''

(:*[[Using SSL with Church|...encrypt my communications with the Church web server?]]:)
(:*[[Newswire#Adding items to the newswire|...add an item to Church's CVC4 newswire?]]:)
*[[Developer Meeting Minutes#Adding meeting minutes to the wiki|...add CVC4 meeting minutes to the wiki?]]
*[[Developer Meeting Minutes#Adding electronic notes to meeting minutes|...add electronic notes to CVC4 meeting minutes?]]
*[[Running a CVC4 Meeting|...run a CVC4 meeting?]]

= Dealing with adding a new theory =
For information on how to add a new theory see [[How to write a theory in CVC4]].